Clock computing Machines

ABSTRACT

A new computational machine is invented, called a clock machine, that is a novel alternative to computing machines (digital computers) based on logic gates. In an embodiment, computation is performed with one or more clock machines that use time. In an embodiment, a cryptographic cipher is implemented with random clock machines, constructed from a non-deterministic process, wherein the compiled set of instructions (i.e., the implementation of the cryptographic procedure) is distinct on each device or chip that executes the cryptographic cipher. In an embodiment, by using a different set of clock machines to execute two different instances of the same cryptographic procedure, each execution of a procedure looks different to malware that may try to infect and subvert the cryptographic procedure. This cryptographic process also makes timing attacks more challenging. In an embodiment, a detailed implementation of the Midori cipher with random clock machines is described.

RELATED APPLICATIONS

This application claims priority benefit of U.S. Provisional Patent Application Ser. No. 62/357,191, entitled Prime Clock Computers, filed Jun. 30, 2016, which is incorporated herein by reference.

BACKGROUND Field of Invention

This invention broadly relates to computing machines and computers. This invention also demonstrates embodiments of this new computer that compute cryptographic machines and hence protect the privacy of information and also protect the execution of the computation.

Prior Art

The subject matter discussed in the background section should not be assumed to be prior art merely as a result of its mention in the background section. Similarly, a problem mentioned in the background section or associated with the subject matter of the background section should not be assumed to have been previously recognized in the prior art. The subject matter in the background section merely represents different approaches, which in and of themselves may also be inventions

Physical implementations of digital computers began in the latter half of the 1930's and early designs were based on various implementations of logic gates [1, 7, 30, 35, 36] (e.g., mechanical switches, electro-mechanical devices, vacuum tubes). The transistor was conceptually invented [21, 22] in the late 1920's, but the first working prototype [3, 27] was not demonstrated until 1947. Transistors act as building blocks for logic gates when they operate above threshold [23] (page 39). When a transistor operates above threshold, it essentially acts as a switch which has two states on or off. The transistor enabled the invention of the integrated circuit [18, 26], which is the physical basis for modern digital computers [16, 17].

SUMMARY and SOME ADVANTAGES OVER PRIOR ART

This invention presents and describes a new computational machine, called a clock machine, that is a novel alternative to computing machines (computers) based on logic gates [28, 31]. This invention describes how to perform computation using one or more clock machines. In some embodiments, the number of time states of a clock is a prime number. For example, as shown in FIG. 1B, clock machine 114 has 13 distinct time states and starts at time state 6. In FIG. 1B, another clock machine 112 has 7 distinct time states and starts at time state 3. In some embodiments, another distinct clock machine may 101 distinct time states. In some embodiments, another distinct clock machine may have 7829 distinct time states. Note the traditional clock has 12 distinct time states, labelled 1, 2, 3, 4, 5, 6, . . . , 12 and is shown in FIG. 1C.

In some alternative embodiments, a clock machine may have a composite number of time states. For example, a clock machine may have a number of time states that is a power of 2 even though 2^(n) when n>1 is not prime. For example, 128 time states is 2⁸ and 65536 time states is 2¹⁶ and 18446744073709551616 time states is 2⁶⁴. The invention described herein combines a finite collection of clock machines to construct a clock computing machine. In some embodiments, clock computing machines may be constructed without using gates or switches.

In some embodiments, a new computational machine (computer) is invented based on the prime numbers and clocks. Consider the prime number 2 and the clock machine [2, 0]. The 2 means that the clock machine has two states {0, 1} and the 0 means that the clock machine starts ticking from time state 0 at time 0. At the next moment of time (i.e., at time 1), clock machine [2, 0] moves to time state 1 and then back to time state 0. Thus, the clock machine [2, 0] ticks 0, 1, 0, 1, and so on. Prime clock [2, 0] machine 102 is shown in FIG. 1A. The clock machine [3, 1] has 3 states {0, 1, 2} and ticks 1, 2, 0, 1, 2, 0 and so on. A [3, 1] prime clock machine 104 is shown in FIG. 1A. These two clock machines, and their respective time states as time proceeds, are also shown in columns 2 and 5 of table 1.

Expressed as the ⊕ operator machine in table 1, two or more clock machines can be composed and their sum computed in (computed in)

. For example, the last column of table 1 shows the sum of clocks [2, 0] and [3, 1], projected into

. In an embodiment, the computation of clock machines is projected into

, since this results in the computation of Boolean functions.

A collection of clock machines generate a commutative group, whereby the associative and commutative properties of prime clock sums enable clock machines to perform a computation in parallel. This simple mathematical property has significance because gates do not preserve the associative property. For example,

(x

y)≠(−x)

y, where operator

represents a NOT gate and A represents an OR gate because

(0

0)=1 while (

0)

0=0. In practice, this means that the OR gate computation A must be performed either before the negation (NOT gate) is applied or after the negation is applied. This means the computation with gates is inherently a serial computation.

In an embodiment, this specification describes how to implement an arbitrary Boolean function with a finite collection of clock machines. As the computation of a digital computer can computed by one or more Boolean functions, the specification describes a new computer based on clocks instead of gates.

In an embodiment, this specification shows how to implement the a cryptographic cipher Midori with only a few prime clock machines. Using the first 8 prime numbers, the Midori cipher is executed with random prime clock machines so that a physical instantiation on each processor chip is unique. In some embodiments, each execution of a cryptographic cipher may have a unique physical instantiation in terms of the clock machine instructions that are executing the cryptographic cipher.

The uniqueness of the physical instantiation follows a biological principle whereby a population that exhibits diversity can be far more challenging for predators or a sentient manipulator of that population. As an example, bacteria organisms are typically able to develop antiobiotic resistance due at least in part to the fact that each bacteria organism of the same species is still unique in the enzymes (proteins) it can build in order to help disable an antibiotic. As another example of population diversity, the variability of the retrovirus (in particular, AIDS) and its ability to quickly evolve has made it far more difficult for scientists to construct a comprehensive vaccine for the AIDS virus.

By using a different set of clock machines to execute the same procedure, each execution of a procedure looks different to the hacker, who may be attempting to reverse engineer the procedure. In the cybersecurity world, digital computer programs are typically compiled to a sequence of machine instructions so that the sequence of machine instructions are identical on two different instances of the same computer chip. In order for a hacker to infect a computer with malware, it is much easier for the hacker to accomplish this when the sequence of machine instructions are identical or similar on two different instances of a chip or virtual machine. This weakness in current computing systems creates huge vulnerabilities in our Internet infrastructure.

In the recent Mirai attack, malware was able to shut down most of the Internet on the East coast for a substantial part of the day [24]. The Mirai attack and other recent cyber attacks have triggered an urgent alarm that developing new machines, methods and procedures resistant to malware infection is a critical issue for industry and for U.S. infrastructure such as air traffic control, the electrical grid and the Internet.

The uniqueness of the random clock machines helps obfuscate the execution of the cryptographic algorithm and helps break up potential timing patterns in the execution of the cipher. Based on extensive mathematical analysis and computational experiments and tests, the clock computing machines have promising capabilities, particularly for highly nonlinear Boolean functions that are desired in cryptography.

The clock machines, described herein, have an important mathematical property that has practical utility. Covered in section 6.14, theorem 8 states: for every natural number n, every Boolean function ƒ:{0, 1}^(n)→{0, 1} can be computed with a finite prime clock sum machine that lies inside an infinite abelian group (

, ⊕). Overall, prime clock machines can act as computational building blocks for clock computing machines—instead of gates [31, 28] used in the prior art. Adding is computationally fast and easy to build in hardware. Another favorable computing property is that prime clock machine addition ⊕ is associative and commutative.

These two group properties enable prime clock machines to compute in parallel, while computers built from gates do not have this favorable property. For example,

(x√y)≠(

x)

y because

(0

0)=1 while (

0)

0=0. In the prior art, the unary gate

and the binary gates

,

form a Boolean algebra [14], so circuits built from gates must have a depth. This means that the gate-based computers used in the prior art have physical and mathematical limitations on the extent to which the prior art gate-based computers can be parallelized.

To better understand the disparity between the parallelization of prime clock sums versus the circuit depth of gates, consider the prime clock sum [7, 3]⊕[13, 6]. A [7, 3] prime clock and a [13, 6] prime clock are shown in FIG. 1B. FIG. 1D shows a Boolean circuit built from logical gates that computes [7, 3]⊕[13, 6] on domain {0, 1}⁴. The Boolean circuit and prime clock sum are equivalent to the Boolean function ƒ:{0, 1}⁴→{0, 1} such that ƒ(x₀x₁x₂x₃)=[(

x₂)

(

x₃)]

[x₀

x₁

x₂

(

x₃)]

[(

(x₀

x₁))

(

x₂)

x₃]. Note [7, 3]⊕[13, 6](m)=ƒ(x₀x₁x₂x₃), where m=x₀+2x₁+4x₂+8x₃.

This disparity is further exacerbated for bit strings x₀x₁ . . . x_(n−1) of length n (i.e., x₀x₁ . . . x_(n−1) lies in {0, 1}^(n)) as n increases. Informally, Shannon's theorem [28] implies that most functions ƒ: {0, 1}^(n)→{0, 1} require on the order

$\frac{2^{n}}{n}$ gates. More precisely, let β(∈,n) be the number of distinct functions ƒ:{0, 1}^(n)→{0, 1} that can be computed by circuits with at most

$\left( {1 - \epsilon} \right)\frac{2^{n}}{n}$ gates built from the NOT, AND, and OR gates. Shannon's theorem states for any ∈>0, then

${\lim\limits_{n->\infty}\frac{\beta\left( {\epsilon,n} \right)}{2^{2^{n}}}} = 0.$

Let the gates of a circuit be labeled as {g₁, g₂, . . . , g_(m)} where m is about

$\frac{2^{n}}{n}.$ The graph connectivity of the circuit specifies that the output of gate g₁ connects to the input of gate g_(k) ₁ , and so on. Shannon's theorem implies that for most of these Boolean functions the graph connectivity requires an exponential (in n) amount of information. This is readily apparent after comparing the number of symbols used in [7, 3]⊕[13, 6] versus the symbolic expression [(

(x₀

x₁))

(

x₂)

x₃]

[x₀

x₁

x₂

(

x₃)]

[(

x₂)

(

x₃)].

Even small prime numbers can help construct a huge number of Boolean functions. Using the first 559 prime numbers, finite prime clock sum machines, (i.e., all primes ≤4051, where 4051 can be represented with 12 bits) can compute any function ƒ₂₀:{0, 1}²⁰→{0, 1}, even though there are 2² ²⁰ =2¹⁰⁴⁸⁵⁷⁶ distinct functions.

Suppose a cryptographic application requires a function g:{0, 1}²⁰→{0, 1}²⁰, where g=(g₀, g₁, . . . , g₁₉) For some functions, in the prior art, more than 1 million gates could be required to directly implement g in hardware since

$\frac{2^{20}}{20} = 52428.$

Boolean functions with good crytographic properties are highly nonlinear [10], so they usually require about

$\frac{2^{n}}{n}$ gates. In our experimental computational tests, we observe that random prime clock machines which compute the Midori64 S-box S₀ and the Midori128 S-box S₁ have average complexity (definition 4) slightly larger than the affine functions A_(a) ₀ _(a) ₁ _(a) ₂ _(a) ₃ _(,c):{0, 1}⁴→{0, 1}, where A_(a) ₀ _(a) ₁ _(a) ₂ _(a) ₃ _(,c)(x₀x₁x₂x₃)=a₀x₀ XOR a₁x₁ XOR a₂x₂ XOR a₃x₃ XOR c. This is quite different from the low gate complexity (prior art) for Boolean affine functions versus a high gate complexity for highly nonlinear Boolean functions. Overall, virtual machines, computational tests and calculations for n=20 demonstrate that clock computing machines can substantially enhance cryptographic methods and improve computing speed over the prior art.

DESCRIPTION of FIGURES and TABLES

In the following figures and tables, although they may depict various examples of the invention, the invention is not limited to the examples depicted in the figures and tables.

FIG. 1A shows a [2, 0] clock machine 102 and below it a [3, 1] clock machine 104.

FIG. 1B shows a [7, 3] clock machine 112 and below it a [13, 6] clock machine 114.

FIG. 1C shows a standard clock, indicating the time 3 o'clock. In terms of the hour, the standard clock has twelve time states: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 and 12. On the standard clock, the small hand and large hand indicate the hour and minutes, respectively. When the minute and the hour are used to indicate the time state, the standard clock has 60*12=720 distinct time states.

FIG. 1D shows a Boolean circuit built from logic gates that computes Boolean function ƒ:{0, 1}→{0, 1} such that ƒ(x₀ x₁ x₂ x₃)=[((

x₂)

(

x₃)]

[x₀

x₁

x₂

(

x₃)]

[(

(x₀

x₁))

(

x₂)

x₃].

FIG. 2A shows an embodiment of a computer network system using clock machines inside each computer node. In some embodiments, the execution may be over the Internet or a part of a network that supports an infrastructure such as the electrical grid, a financial exchange, or a power plant, which can be used with the embodiments of FIGS. 1A and 1B.

FIG. 2B shows an embodiment of a clock machine hardware architecture, which includes a processor that computes using clock machines, memory and input/output system, which may be using the clock machines of of FIGS. 1A and 1B.

FIG. 3 shows an embodiment of one or more clock machines, combining to implement the sequence of instructions in machine procedures 1, 2, 3 and 4. Procedures 1, 2, 3 and 4 are comprehensively specified in section 6.6, titled CLOCK MACHINE COMPUTATION. In an embodiment, FIG. 3 represents a virtual machine implementation. In another embodiment, FIG. 3 represents a hardware implementation.

FIG. 4A shows a D-type flip flop (hardware) implemented with NAND gates. Q′ equals NOT Q. FIG. 4B shows a D-type flip flop (hardware) in a form so that the internal implementation in terms of NAND gates is not shown. This diagram of a D-type flip flop is convenient for representing the D-type flip flop as a building block for clock machines.

FIG. 4C shows a D-type flip flop with the output of Q′ feeding back into input D of the flip flop, where Q′ is the logical NOT of Q. The waveforms show the behavior of output Q. Output Q flips its state from 0 to 1 or 1 to 0 upon every downward edge of the clock signal, labelled CLK.

FIG. 4D shows a hardware implementation of a [p, 0] clock machine, using two clock signals I and p and a single D-type flip flop that has the same feedback structure as FIG. 4C. p is the amount of time that clock signal stays high before it switches to low (0) for a short period of time, when clock signal I is low. In a hardware embodiment, clock signal I may have a period of 1 millisecond and so clock signal p has a period of p milliseconds. In an embodiment, clock signal I may have a period of 1 nanosecond and clock signal p has a period of p nanoseconds.

FIG. 5A shows an embodiment of a non-deterministic process, based on quantum randomness. Non-deterministic process 542 is based on the quantum behavior of photons. Non-deterministic process 542 contains a light emitting diode 546 that emits photons and a phototransistor 544 that absorbs photons.

FIG. 5B shows an embodiment of a non-deterministic process, based on quantum randomness. Non-deterministic process 552 is based on the quantum behavior of photons. Non-deterministic process 552 contains a light emitting diode 556 that emits photons and a photodiode 554 that absorbs photons.

FIG. 6 shows a light emitting diode 602, which emits photons and in some embodiments is part of the non-deterministic process. The light emitting diode contains a cathode, a diode, an anode, one terminal pin connected to the cathode and one terminal pin connected to the anode, a p-layer of semiconductor, an active region, an n-layer of semiconductor, a substrate and a transparent plastic case.

Table 1 shows some 2-clocks, 3-clocks and some prime clock sums in the abelian group

.

Table 2 shows some 5-clocks and some 5-clock sums projected into the abelian group Ω₂ that has 2 distinct time states as output.

Table 3 shows some prime clocks and their sum in the abelian group Ω₅ has 5 distinct time states.

Table 4 shows all 7-clock machines, projected into abelian group Ω₂.

Table 5 shows all 16 Boolean functions ƒ_(k):{0, 1}²{0, 1}, their respective truth tables and a corresponding prime clock sum machine that implements each of these 16 Boolean functions. These 16 Boolean functions include the standard logic gates such as AND, OR, NOT, NAND, XOR, and NOR. Thus, this table demonstrates that prime clock sums can act as computational primitives.

Table 6 shows a complete specification of 2-bit multiplication in terms of the 4 Boolean multiplication functions

₀:{0, 1}⁴→{0, 1},

₁:{0,1}⁴→{0,1},

₂:{0,1}⁴→{0, 1}, and

₃:{0,1}⁴→{0, 1}.

Table 7 shows block size, key size, cell size and number of rounds parameters for two versions of the Midori cipher: Midori 64 and Midori 128.

Table 8 shows a complete specification of the Midori 4-bit bijective substitution boxes S₀ and S₁.

Table 9 shows the Midori Round constants.

Table 10 shows a specification of the Midori 64 Boolean functions π₀∘S₀, π₁∘S₀, π₂∘S₀, and π₃∘S₀ and corresponding random prime clock sum machines that compute these 4 functions. The random prime clock sum machines were constructed with machine procedure 5.

Table 11 shows a specification of the Midori 128 Boolean functions π₀∘S₁, π₁∘S₁, π₂∘S₁, and π₃∘S₁ and corresponding random prime clock sum machines that compute these 4 functions.

Table 12 shows CPU time tests on prime clock machines [p, t], where p is prime number in the set {2, 3, 5, 7, 11, 13, 17, 19} and starting time state t satisfies 0≤t<p.

Table 13 shows random prime clock sum machines that compute affine maps used by the Midori cipher.

DETAILED DESCRIPTION

6.1 Machine Terms and Definitions

In this specification, the term “location” may refer to geographic locations and/or storage locations. A particular storage location may be a collection of contiguous and/or noncontiguous locations on one or more machine readable media. Two different storage locations may refer to two different sets of locations on one or more machine-readable media in which the locations of one set may be intermingled with the locations of the other set.

In this specification, the term “machine-readable medium” refers to any non-transitory medium capable of carrying or conveying information that is readable by a machine. One example of a machine-readable medium is a computer-readable medium. Another example of a machine-readable medium is paper having holes that are detected that trigger different mechanical, electrical, and/or logic responses. The term machine-readable medium also includes media that carry information while the information is in transit from one location to another, such as copper wire and/or optical fiber and/or the atmosphere and/or outer space.

In this specification, the term “process” refers to a series of one or more operations. In an embodiment, “process” may also include operations or effects that are best described as non-deterministic. In an embodiment, “process” may include some operations that can be executed by a digital computer program and some physical effects that are non-deterministic, which cannot be executed by a digital computer program and cannot be performed by a finite sequence of processor instructions.

In this specification, the term “procedure” refers to a sequence of one or more instructions, executed by a machine. A procedure typically is executed by a finite machine that executes a finite number of instructions with finite memory.

In this specification, machine-implemented procedures and processes execute algorithms and combine non-deterministic processes with a machine. The formal notion of “algorithm” was introduced in Turing's work [29] and refers to a finite machine that executes a finite number of instructions with finite memory. In other words, an algorithm can be executed with a finite number of machine instructions on a processor. “Algorithm” is a deterministic process in the following sense: if the finite machine is completely known and the input to the machine is known, then the future behavior of the machine can be determined. In contrast, there is hardware that can measure quantum effects from photons (or other physically non-deterministic processes), whose physical process is non-deterministic. The recognition of non-determinism produced by quantum randomness and other quantum embodiments is based on decades of experimental evidence and statistical testing. Furthermore, the quantum theory—derived from the Kochen-Specker theorem and its extensions [19, 8]—predicts that the outcome of a quantum measurement cannot be known in advance and cannot be generated by a Turing machine (digital computer program). As a consequence, a physically non-deterministic process cannot be generated by an algorithm: namely, a sequence of operations executed by a digital computer program. FIGS. 5A and 5B show embodiments of a non-deterministic process arising from quantum events; that is, the emission and absorption of photons.

Some examples of physically non-deterministic processes are as follows. In some embodiments that utilize non-determinism, photons strike a semitransparent mirror and can take two or more paths in space. In one embodiment, if the photon is reflected by the semitransparent mirror, then it takes on one bit value b∈{0,1}; if the photon passes through by the semitransparent mirror, then the non-deterministic process produces another bit value 1-b. In another embodiment, the spin of an electron may be sampled to generate the next non-deterministic bit. In still another embodiment, a protein, composed of amino acids, spanning a cell membrane or artificial membrane, that has two or more conformations can be used to detect non-determinism the protein conformation sampled may be used to generate a non-deterministic value in {0, . . . n−1} where the protein has n distinct conformations. In an alternative embodiment, one or more rhodopsin proteins could be used to detect the arrival times of photons and the differences of arrival times could generate non-deterministic bits. In some embodiments, a Geiger counter may be used to sample non-determinism

In this specification, the term “photodetector” refers to any type of device or physical object that detects or absorbs photons. A photodiode is an embodiment of a photodetector. A phototransistor is an embodiment of a photodetector. A rhodopsin protein is an embodiment of a photodetector.

6.2 Non-Deterministic Processes

FIG. 5A shows an embodiment of a non-deterministic process 542 arising from quantum events: that is, non-deterministic process 542 uses the emission and absorption of photons for its non-determinism. In FIG. 5A, phototransistor 544 absorbs photons emitted from light emitting diode 546. In an embodiment, the photons are produced by a light emitting diode 546. In FIG. 5B, non-deterministic process 552 has a photodiode 554 that absorbs photons emitted from light emitting diode 556. In an embodiment, the photons are produced by a light emitting diode 556.

FIG. 6 shows a light emitting diode (LED) 602. In an embodiment, LED 602 emits photons and is part of the non-deterministic process 542 (FIG. 5A). In an embodiment, LED 602 emits photons and is part of the non-deterministic process 552 (FIG. 5B). LED 602 contains a cathode, a diode, an anode, one terminal pin connected to the cathode and one terminal pin connected to the anode, a p-layer of semiconductor, an active region, an n-layer of semiconductor, a substrate and a transparent plastic case. The plastic case is transparent so that a photodetector outside the LED case can detect the arrival times of photons emitted by the LED. In an embodiment, photodiode 544 absorbs photons emitted by LED 602. In an embodiment, phototransistor 554 absorbs photons emitted by LED 602.

The emission times of the photons emitted by the LED experimentally obey the energy-time form of the Heisenberg uncertainty principle. The energy-time form of the Heisenberg uncertainty principle contributes to the non-determinism of non-deterministic process 542 or 552 because the photon emission times are unpredictable due to the uncertainty principle. In FIGS. 5A and 5B, the arrival of photons are indicated by a squiggly curve with an arrow and by next to the curve. The detection of arrival times of photons is a non-deterministic process. Due to the uncertainty of photon emission, the arrival times of photons are quantum events.

In FIGS. 5A and 5B, by refers to the energy of a photon that arrives at photodiode 544, respectively, where h is Planck's constant and v is the frequency of the photon. In FIG. 5A, the p and n semiconductor layers are a part of a phototransistor 544, which generates and amplifies electrical current, when the light that is absorbed by the phototransistor. In FIG. 5B, the p and n semiconductor layers are a part of a photodiode 554, which absorbs photons that strike the photodiode.

A photodiode is a semiconductor device that converts light (photons) into electrical current, which is called a photocurrent. The photocurrent is generated when photons are absorbed in the photodiode. Photodiodes are similar to standard semiconductor diodes except that they may be either exposed or packaged with a window or optical fiber connection to allow light (photons) to reach the sensitive part of the device. A photodiode may use a PIN junction or a p-n junction to generate electrical current from the absorption of photons. In some embodiments, the photodiode may be a phototransistor.

A phototransistor is a semiconductor device comprised of three electrodes that are part of a bipolar junction transistor. Light or ultraviolet light activates this bipolar junction transistor. Illumination of the base generates carriers which supply the base signal while the base electrode is left floating. The emitter junction constitutes a diode, and transistor action amplifies the incident light inducing a signal current.

When one or more photons with high enough energy strikes the photodiode, it creates an electron-hole pair. This phenomena is a type of photoelectric effect. If the absorption occurs in the junction's depletion region, or one diffusion length away from the depletion region, these carriers (electron-hole pair) are attracted from the PIN or p-n junction by the built-in electric field of the depletion region. The electric field causes holes to move toward the anode, and electrons to move toward the cathode; the movement of the holes and electrons creates a photocurrent. In some embodiments, the amount of photocurrent is an analog value, which can be digitized by a analog-to-digital converter. In some embodiments, the analog value is amplified before being digitized.

In an embodiment, the sampling of the digitized photocurrent values may converted to threshold times as follows. A photocurrent threshold θ is selected as a sampling parameter. If a digitized photocurrent value i₁ is above θ at time t₁, then t₁ is recorded as a threshold time. If the next digitized photocurrent value i₂ above θ occurs at time t₂, then t₂ is recorded as the next threshold time. If the next digitized value i₃ above θ occurs at time t₃, then t₃ is recorded as the next threshold time.

After three consecutive threshold times are recorded, these three times can determine a bit value as follows. If t₂−t₁>t₃−t₂, then the non-deterministic process produces a 1 bit. If t₂<t₁<t₃−t₂, then the non-deterministic process produces a 0 bit. If t₂−t₁=t₃−t₂, then NO bit information is produced. To generate the next bit, non-deterministic process 542 or 552 continues the same sampling steps as before and three new threshold times are produced and compared.

In an alternative sampling method, a sample mean μ is established for the photocurrent, when it is illuminated with photons. In some embodiments, the sampling method is implemented as follows. Let i₁ be the photocurrent value sampled at the first sampling time. i₁ is compared to μ. ∈ is selected as a parameter in the sampling method that is much smaller number than μ. If i₁ is greater than μ+∈, then a 1 bit is produced by the non-deterministic process 542 or 552. If i₁ is less than μ−∈, then a 0 bit is produced by non-deterministic process 542 or 552. If i₁ is in the interval [μ−∈, μ+∈], then NO bit is produced by non-deterministic process 542 or 552.

Let i₂ be the photocurrent value sampled at the next sampling time. i₂ is compared to μ. If i₂ is greater than μ+∈, then a 1 bit is produced by the non-deterministic process 542 or 552. If i₂ is less than μ−∈, then a 0 bit is produced by the non-deterministic process 542 or 552. If i₂ is in the interval [μ−∈, μ+∈], then NO bit is produced by the non-deterministic process 542 or 552. This alternative sampling method continues in the same way with photocurrent values i₃, i₄, and so on. In some embodiments, the parameter E is selected as zero instead of a small positive number relative to μ.

Some alternative hardware embodiments of a non-deterministic process are described below. In some embodiments that utilize non-determinism to produce random clock machines, a semitransparent mirror may be used. In some embodiments, the mirror contains quartz (glass). The photons that hit the mirror may take two or more paths in space. In one embodiment, if the photon is reflected, then the non-deterministic process creates the bit value b∈{0, 1}; if the photon is transmitted, then the non-deterministic process creates the other bit value 1−b. In another embodiment, the spin of an electron may be sampled to generate the next non-deterministic bit. In still another embodiment of generating random clock machines, a protein, composed of amino acids, spanning a cell membrane or artificial membrane, that has two or more conformations can be used to detect non-determinism the protein conformation sampled may be used to generate a value in {0, . . . n−1} where the protein has n distinct conformations. In an alternative embodiment, one or more rhodopsin proteins could be used to detect the arrival times t₁<t₂<t₃ of photons and the differences of arrival times (t₂−t₁>t₃−t₂ versus t₂−t₁<t₃−t₂) could generate non-deterministic bits that produce random values.

In some embodiments, the seek time of a hard drive can be used as random values as the air turbulence in the hard drive affects the seek time in a non-deterministic manner. In some embodiments, local atmospheric noise can be used as a source of random values. For example, the air pressure, the humidity or the wind direction could be used. In other embodiments, the local sampling of smells based on particular molecules could also be used as a source of non-determinism.

In some embodiments, a Geiger counter may be used to sample non-determinism and generate random values. In these embodiments, the unpredictability is due to radioactive decay rather than photon emission, arrivals and detection.

6.3 One-Way Hash Functions

A one-way hash function Φ, has the property that given an output value z, it is computationally intractable to find an information element m_(z), such that Φ(m_(z))=z. In other words, a one-way function Φ is a function that can be easily computed, but that its inverse Φ⁻¹ is computationally intractable to compute [9]. A computation that takes 10¹⁰¹ computational steps is considered to have computational intractability of 10¹⁰¹.

More details are provided on computationally intractable. In an embodiment, there is an amount of time T that encrypted information must stay secret. If encrypted information has no economic value or strategic value after time T, then computationally intractable means that the number of computational steps required by all the world's computing power will take more time to compute than time T. Let C(t) denote all the world's computing power at the time t in years.

Consider an online bank transaction that encrypts the transaction details of that transaction. Then in most embodiments, the number of computational steps that can be computed by all the world's computers for the next 30 years is in many embodiments likely to be computationally intractable as that particular bank account is likely to no longer exist in 30 years or have a very different authentication interface.

To make the numbers more concrete, the 2013 Chinese supercomputer that broke the world's computational speed record computes about 33,000 trillion calculations per second [12]. If T=1 one year and we can assume that there are at most 1 billion of these supercomputers. (This can be inferred from economic considerations, based on a far too low 1 million dollar price for each supercomputer. Then these 1 billion supercomputers would cost 1,000 trillion dollars.). Thus, C(2014)×1 year is less than 10⁹×33×10¹⁵×3600×24×365=1.04×10³³ computational steps.

As just discussed, in some embodiments and applications, computationally intractable may be measured in terms of how much the encrypted information is worth in economic value and what is the current cost of the computing power needed to decrypt that encrypted information. In other embodiments, economic computational intractability may be useless. For example, suppose a fusion power plant wants to keep its codes and infrastructure unbreakable to cyber terrorists. Suppose T=2000 years because it is about twice the expected lifetime of the power plant. Then 2000 years×C(4017) is a better measure of computationally intractable for this application. In other words, for critical applications that are beyond an economic value, one should strive for a good estimate of the world's computing power.

One-way functions that exhibit completeness and a good avalanche effect or the strict avalanche criterion [32] are preferable embodiments: these properties are favorable for one-way hash functions. The definition of completeness and a good avalanche effect are quoted directly from [32]:

-   -   If a cryptographic transformation is complete, then each         ciphertext bit must depend on all of the plaintext bits. Thus,         if it were possible to find the simplest Boolean expression for         each ciphertext bit in terms of plaintext bits, each of those         expressions would have to contain all of the plaintext bits if         the function was complete. Alternatively, if there is at least         one pair of n-bit plaintext vectors X and X_(i) that differ only         in bit i, and ƒ(X) and ƒ(X_(i)) differ at least in bit j for all         {(i, j):1≤i, j≤n}, the function ƒ must be complete.     -   For a given transformation to exhibit the avalanche effect, an         average of one half of the output bits should change whenever a         single input bit is complemented. In order to determine whether         a m×n (m input bits and n output bits) function ƒ satisfies this         requirement, the 2^(m) plaintext vectors must be divided into         2^(m−1) pairs, X and such that X and X_(j) differ only in bit i.         Then the 2^(m−1) exclusive-or sums V_(i)=ƒ(X)⊕ƒ(X_(i)) must be         calculated. These exclusive-or sums will be referred to as         avalanche vectors, each of which contains n bits, or avalanche         variables.     -   If this procedure is repeated for all i such that 1≤i≤m and one         half of the avalanche variables are equal to 1 for each i, then         the function ƒ has a good avalanche effect. Of course this         method can be pursued only if m is fairly small; otherwise, the         number of plaintext vectors becomes too large. If that is the         case then the best that can be done is to take a random sample         of plaintext vectors X, and for each value i calculate all         avalanche vectors V_(i). If approximately one half the resulting         avalanche variables are equal to 1 for values of i, then we can         conclude that the function has a good avalanche effect.

A hash function, also denoted as Φ, is a function that accepts as its input argument an arbitrarily long string of bits (or bytes) and produces a fixed-size output of information. The information in the output is typically called a message digest or digital fingerprint. In other words, a hash function maps a variable length m of input information to a fixed-sized output, Φ(m), which is the message digest or information digest. Typical output sizes range from 160 to 512 bits, but can also be larger. An ideal hash function is a function Φ, whose output is uniformly distributed in the following way: Suppose the output size of Φ is n bits. If the message m is chosen randomly, then for each of the 2^(n) possible outputs z, the probability that Φ(m)=z is 2^(−n). In an embodiment, the hash functions that are used are one-way.

A good one-way hash function is also collision resistant. A collision occurs when two distinct information elements are mapped by the one-way hash function Φ to the same digest. Collision resistant means it is computationally intractable for an adversary to find collisions: more precisely, it is computationally intractable to find two distinct information elements m₁, m₂ where m₁≠m₂ and such that Φ(m₁)=Φ(m₂).

A number of one-way hash functions may be used to implement one-way hash function 148. In an embodiment, SHA-512 can implement one-way hash function 148, designed by the NSA and standardized by NIST [25]. The message digest size of SHA-512 is 512 bits. Other alternative hash functions are of the type that conform with the standard SHA-384, which produces a message digest size of 384 bits. SHA-1 has a message digest size of 160 bits. An embodiment of a one-way hash function 148 is Keccak [6]. An embodiment of a one-way hash function 148 is BLAKE [2]. An embodiment of a one-way hash function 148 is Gr∅stl [13]. An embodiment of a one-way hash function 148 is JH [33]. Another embodiment of a one-way hash function is Skein [11].

6.4 Symbol Meanings And Machine Notation

The symbol

represents the unary NOT gate.

(0)=1 and

(1)=0. The symbol

represents the binary OR gate. 0

0=0 and 0

1=1

0=1♭1=1. The binary AND gate is represented with

. 1

1=1 and 0

1=1

0=0

0=0. In the prior art, gates are typically implemented with transistors.

A bit has two states 0 or 1. In some embodiments, a bit is represented with voltage. In another embodiment, a bit may be represented with the polarization of a photon. The expression {0, 1}^(n) represents the set of all n-bit strings. There are 2^(n) different n-bit strings. The expression {0, 1}⁴ represents the all 4-bit strings. 0101 is a 4-bit string. There are 16 different 4-bit strings

Symbol

denotes the integers and

the non-negative integers. For any n∈

such that n≥2 and a∈

such that 0≤a≤n−1, consider the equivalence class [a]={a+kn:k∈

} that is a subset of

. Let

_(n)={[0], [1], . . . , [n−1]}. mod is the modulo function and a mod n is the remainder when a is divided by n. In the standard manner, (

_(n), +_(n)) is an abelian group, where binary operator +_(n) is defined as [a]+_(n)[b]=[(a+b)mod n]. For clarity, the brackets are sometimes omitted and [a]∈

_(n) is represented with the integer a, satisfying 0≤a≤n−1. The field F₂ is the two elements {0,1}, where + is addition modulo 2 and multiplication * is equal to

(AND).

The least common multiple of positive integers a and b is lcm(a, b). The greatest common divisor of a and b is gcd(a, b). Let p₁=2, p₂=3, p₃=5, p₄=7, . . . where the nth prime number is p_(n). Let p be an odd prime. p is called a 3 mod 4 prime if

$\frac{p - 1}{2}$ is odd. p is called a 1 mod 4 prime if

$\frac{p - 1}{2}$ is even. log₂(n) is the logarithm base 2 of n. [x]=the smallest integer l such that l≥x. 6.5 Clock Machine Specifications

This section provides specifications and procedures related to prime clocks executing in one or more prime clock machines.

Machine Specification 1. Prime Clock Machine

Let p be a prime number. Let t∈

such that 0≤t≤p−1. Define prime clock machine [p, t]:

→

as [p,t](m)=(m+t) mod p. Prime clock machine [p, t] is called a p-clock machine and is a computational machine that starts ticking (i.e., starts changing its time state) with its hand pointing to t; this is another of saying that its time state starts at t. The number p is the total number of time states that the clock [p, t] has.

In some embodiments, p is a composite number. Herein the expression clock [p, s] always assumes that the starting time state s satisfies 0≤s≤p−1. Thus, if p≠q or s≠t, then prime clock [p, s] is not equal to prime clock [q, t]; equivalently, if p=q and s=t, then [p, s]=[q, t]. If p≠q, the clock [p, s] has a different number of time states than clock [q, t]. If s≠t, the clock [p, s] has a different starting time state than clock [q, t].

In machine specification 1, the phrase clock machine was chosen because p-clock machines have some similarities to traditional 12-clocks common in some homes. It is important to recognize that clock machine [p, t] is a computational machine that has different physical instantiations, depending on the hardware or software embodiment.

In some software embodiments, the clock machine is a virtual machine. A virtual machine means the clock machine may be implemented in C source code or Python source code or another suitable programming language. The source code implementation of the clock machine is compiled to execute on a standard operating system such was Windows, Linux, or Apple OS.

A clock machine should not be confused with a CPU clock that is built from transistor gates and uses a crystal to provide the voltage oscillations and voltage changes in the transistor gates.

Another notable difference is that CPU clocks typically tick based on a power of 2; that is, 2^(n) where n is a positive integer. Clock machines tick (i.e., changes its time state) usually based on clocks that use prime numbers as the number of states in the clock. In a 7-clock, the prime clock machine ticks based on 7 distinct states {0, 1, 2, 3, 4, 5, 6} before it repeats. Table 4 shows some different 7-clock machines.

For the nth prime p_(n), let

_(n)={[p_(n), 0], [p_(n), 1], . . . , [p_(n), p_(n)−1]} be the distinct p_(n)-clocks. The collection of all prime clocks is defined as

= ⋃ ∞ n = 1 ⁢ n ( 6.1 )

For n≥2, let Ω_(n)=

. Define Π_(n):

→Ω_(n) as the projection of each p-clock machine into Ω_(n) where Π_(n)([p, t](m))=[p, t](m) mod n.

Machine Specification 2.

Let n∈

such that n≥2. On the collection

of clock machines, define the binary operator machine ⊕_(n) as ([p,s]⊕_(n) [q, t])(m)=([p,s](m)+[q, t](m)) mod n, where + is computed in

. Observe that the prime clock machine [p, s]⊕_(n) [q, t] computes in Ω_(n).

Machine Specification 3. Finite Prime Clock Sum Machine

Similarly, with prime clock machines [q₁,t₁], [q₂, t₂] . . . and [q_(L),t_(L)], a new machine [q₁, t₁]⊕_(n)[q₂,t₂] . . . ⊕_(n)[q_(L), t_(L)]:

→

_(n) can be constructed. From a mathematics perspective of how the machine behaves, [q₁,t₁]⊕_(n) [q₂, t_(2]) . . . ⊕_(n) [q_(L), t_(L)] is sometimes called a function. For each m∈

, define ([q₁, t₁]⊕_(n)[q₂, t₂]⊕_(n) . . . ⊕_(n) [q_(L), t_(L)])(m)=([q₁, t₁](m)+[q₂, t₂](m)+ . . . +[q_(L),t_(L)](m)) mod n, where + is computed in

. [q₁, t₁]⊕_(n) [q₂, t₂] . . . ⊕_(n)[q_(L), t_(L)] is called a finite prime clock sum machine in Ω_(n).

In some embodiments, the binary operation machine ⊕_(n) builds prime clock sum machines from prime clock machines (i.e., 306 of FIG. 3) that are executed natively in hardware. The computational operation ⊕_(n) is shown in adding instructions 308 of FIG. 3. A useful way to think about the ⊕_(n) operation is that it combines the outputs of one or more (i.e., L≥1) clock machines [q₁, t₁], [q₂, t₂], . . . [q_(L), t_(L)].

In FIG. 3, modulo instructions 310 refer to the modulo operation (t_(k)+i) mod q_(k), represented by symbols [q_(k), t_(k)](i). In machine specification 3, modulo instructions 310 of FIG. 3, refer to the modulo operation (t_(k)+m) mod q_(k), for each 1≤k≤L and the operator mod n, applied to the sum ([q₁, t₁](m)+[q₂, t₂](m)+ . . . +[q_(L), t_(L)](m)).

In some hardware embodiments, the hardware uses semiconductor materials such as silicon and doping elements such as boron (3 valence electrons) and phosphorus (5 valence electrons). In some embodiments, these semiconductor materials be used to implement transistors that act as components in a flip flop. In some embodiments, these semiconductor materials are used to build D-type flip flops. A D-type flip flop is shown in FIGS. 4A, 4B, 4C and 4D.

FIG. 4D shows a hardware implementation of a [p, 0] clock machine, using two clock signals I and P and a single D-type flip flop that has the same feedback structure as FIG. 4C. p is the amount of time that clock signal stays high before it switches to low (0) for a short period of time, when clock signal I is low. This hardware implementation, using a D-type flip flop is independent of the physical units of time. In a hardware embodiment, clock signal I may have a period of 1 millisecond and so clock signal P has a period of p milliseconds. In another embodiment, clock signal I may have a period of 1 nanosecond and clock signal P has a period of p nanoseconds.

In FIG. 4D, the waveform for clock signal I. At the beginning of this waveform, t₀ is the time when the clock signal I starts to rise from low (0) to high (1). The time δ is the amount of time after t₀ that the clock signal I first becomes high. The wavelength time λ=t_(i+1)−t_(i). For example, λ=t₁−t₀. In other words, λ is the amount of time between consecutive pulses, coming from the clock signal I.

In FIG. 4D, the waveform for clock signal P is below the waveform for clock signal I. The waveform for clock signal P also starts to rise from low to high at time t₀. However, after the waveform for clock signal P first reaches high, it stays high for a time of pλ−2δ. This is so that via the AND gate with inputs of clock signal I and clock signal P, the clock signal I toggles the output Q between low and high during a duration of time equal to λ. The clock signal from P starts to decrease from high to low at time t_(p)−δ; clock signal from P first reaches a low state again at time t_(p). The clock signal from P stays low until time t_(p)+λ=t_(p+1). This means that the output of the AND gate will stay low during the first downward edge of clock signal I after time t_(p). Thus, on this first downward edge just after time t_(p), the D-type flip flop will not toggle from 0 to 1. This lack of the D-type flip flop not toggling corresponds to the fact that the prime clock machine [p, 0] satisfies the property that [p, 0](p−1)=0 and [p, 0](p)=0.

A [p, s] clock machine, where 0<s<p, can be constructed in a similar way to the clock machine [p, 0], by translating the waveform of P, shown in FIG. 4D, by an amount of time equal to sλ.

In some embodiments, elements such as aluminum, indium and arsenic, and antimony are used to build the semiconductor hardware that executes one or more clock machines. In some embodiments, these semi-conductor materials are used to build flip flops that help implement a clock machine, similar to the one shown in FIG. 4D. In other embodiments, the binary operation machine ⊕_(n) (shown in addition instructions 308 and modulo instructions 310 of FIG. 3) combines the outputs of prime clock machines to build prime clock sum machines that are implemented in software; in some embodiments, a prime clock sum machine is implemented as a virtual machine. In an embodiment, the virtual machine executes on computing system 250 in FIG. 2B. In an embodiment, the virtual machine executes in a distributed manner on the computing system shown in FIG. 2A.

Machine Specification 4. Prime Clock Sum Complexity

The complexity map

is defined as

([p,t])=2[log₂(p)] if p>2 and

([2, t])=4. The complexity of [q₁, t₁]⊕_(n)[q₂, t₂] . . . ⊕_(n)[q_(L), t_(L)] is

$\sum\limits_{i = 1}^{l}{{C\left\lbrack {q_{i},t_{i}} \right\rbrack}.}$ Machine Specification 5. Let r₁, . . . r_(k) be k prime numbers and q₁, . . . q_(r) be r prime numbers. Let ƒ=[r₁, s₁]⊕_(n)[r₂, s₂] . . . ⊕_(n)[r_(k), s_(k)]. Let g=[q₁, t₁]⊕_(n)[q₂, t₂] . . . ⊕_(n)[q_(L), t_(L)]. Define ƒ⊕_(n)g in Ω_(n) as (ƒ⊕_(n)g) (m)=ƒ(m)+_(n)g(m), where +_(n) is the binary operator in the group (

_(n), +_(n)).

Machine specification 5 is well-defined with respect to machine specification 3. In particular, ƒ⊕_(n)g=[r₁, s₁]⊕_(n)[r₂, s₂] . . . ⊕_(n) [r_(k), s_(k)]⊕_(n) [q₁, t₁]⊕_(n) [q₂, t₂] . . . ⊕_(n)[q_(L), t_(L)] because (m₁+m₂) mod n=((m₁ mod n)+(m₂ mod n)) mod n for any m₁, m₂∈γ. (See remark 1 in the appendix.)

The binary operator machine ⊕_(n) can be extended to all of Ω_(n). For any ƒ, g∈Ω_(n), define (ƒ⊕_(n) g) (m)=ƒ(m)+_(n)g(m). The associative property (ƒ⊕_(n)g)⊕_(n)h=ƒ⊕_(n)(g⊕_(n)h) follows immediately from the fact that +_(n) is associative. The zero function 0, where 0(m)=0 in

_(n), is the identity in Ω_(n). For any ƒ in Ω_(n), its unique inverse ƒ⁻¹ is defined as ƒ⁻¹(m)=−ƒ(m), where −ƒ(m) is the inverse of ƒ(m) in the group (

_(n), +_(n)). The commutativity of ⊕_(n) follows from the commutativity of +_(n), so (Ω_(n), ⊕_(n)) is an abelian group.

Let

be a collection of the prime clock machines

. Using the projection Π_(n) of

into Ω_(n), define

={H:H⊇Π_(n)(

) and H is a subgroup of Ω_(n)}.

generates a subgroup

⋂ H ⁢ ⁢ ϵ ⁢ ⁢ S H of machines computing over (Ω_(n), ⊕_(n)).

In some computing applications and embodiments, such as cryptography, the ciphers such as Midori [4] are computed with Boolean functions, so the specification sometimes refers to subgroups of Ω₂, generated by a finite number of prime clocks. Consequently, the symbol ⊕ throughout the patent specification represents the symbol ⊕₂. In other embodiments, the prime clock machine may compute over subgroups of Ω₂₅₆ or subgroups over Ω₂ ₆₄ . In these embodiments, the subscript will be explicitly shown as in the symbols ⊕₂₅₆ or Ω₂ ₆₄ .

6.6 Clock Machine Computation

Let F_(n) denote the set of all Boolean functions in n variables. Mathematically, F_(n)={ƒ_(n)|ƒ_(n):{0, 1}^(n)→{0, 1}}, so F_(n) contains 2² ^(n) distinct functions with an n-bit string as input and the output is a single bit. With prime clock sum machine embodiments in mind, it is convenient to think of ƒ_(n)∈F_(n) as a binary string of length 2^(n), called the truth-table of ƒ_(n). Table 5 shows all 16 Boolean functions in F₂ and shows corresponding prime clock machines that compute each of these 16 functions. Since any universal computing machine [29, 30] can be constructed from these functions in F₂, this table demonstrates that prime clocks can be used to construct a universal machine. In some embodiments, it is advantageous to design prime clock machines that compute Boolean functions for substantially higher values of n in order to exploit the computational advantages of prime clock machines since they can compute in parallel.

Consider clock machine [p, s]⊕[q, t] in Ω₂. The first 2^(n) elements of [p, s]⊕[q, t] refer to the bit string ([p s]⊕[q, t]) (0), ([p, s]⊕[q, t]) (1), . . . , ([p, s]⊕[q, t]) (2^(n)−1) of length 2^(n). The first 2^(n) elements of [p, s]⊕[q, t] represent a Boolean function ƒ_(n)⊕F_(n). In some embodiments with q₁, . . . , q_(L) as primes, the first 2^(n) elements of [q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(L), t_(L)] represent a Boolean function ƒ_(n)∈F_(n).

Consider clock machine [q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(L),t_(L)] whose first 2^(n) elements represent a truth table in F_(n); this truth table is a bit string with length 2^(n). Machine procedure 1 shows how [q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(L),t_(L)] computes the Boolean function [q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(L),t_(L)]:{0,1}^(n){0, 1} in L steps, where L is the number of clocks. The input is stored in the variable x, which takes up n bits of memory 256, shown in FIG. 2B. The output bit is stored in the variable y, which takes up 1 bit of memory 256, shown in FIG. 2B. In other words, computational machine l computes y=[q₁, t₁]⊕[q₂,t₂]⊕ . . . ⊕[q_(L), t_(L)](x).

Machine Procedure 1. INPUT: x is a bit string in {0, 1}^(n) store input value in x which takes up n bits of memory. set y = 0 set k = 1 while (k ≤ L) { set e = (t_(k) + x) mod q_(k) set e = e mod 2 set y = (y + e) mod 2 increment k } OUTPUT: y is 0 or 1.

The output y is called a bit output because y is 0 or 1. Output y is produced, by combining the output from the L clock machines [q₁, t₁], [q₂, t₂], . . . [q_(L),t_(L)]. In some embodiments, machine procedure 1 is coded in a programming language such as C, Python, JAVA, Haskell, LISP or Ruby and executes as a virtual machine on a standard operating system such as Apple OS, Linux, Unix, or Windows. In other embodiments, machine procedure 1 can be coded in a programming language such as C or Python and then compiled to execute on a field programmable gate array (FPGA). In other embodiments, machine procedure 1 can be implemented directly in hardware with flip flops. FIGS. 4A, 4B, and 4C show how to implement a hardware prime clock machine from a D-flip flop.

In some embodiments, machine procedure 1 executes the two instructions set e=(t_(k)+x) mod q_(k) and set e=e mod 2, inside the while loop, in parallel with L prime clock devices implemented in hardware. In some embodiments, the prime clock devices are implemented in semiconductor hardware. In some semiconductor embodiments, the prime clock machines are constructed with counters that reset after a prime number of state changes. In these embodiments, the mod 2 operator is implemented by selecting the least significant of the counter. In other semiconductor hardware embodiments, the output of a single prime clock machine is stored in a table in memory 256, shown in FIG. 2B. In some embodiments, the prime clocks are implemented with strands of DNA or RNA. In an embodiment, one or more prime clock machines with hardware architecture (as shown in FIG. 2B) execute machine instructions according to machine procedure 1.

Machine Procedure 2. A Prime Clock Sum in Ω₂ Computes a Boolean Function INPUT: i set r₁ = (t₁ + i) mod q₁ set r₂ = (t₂ + i} mod q₂ . . . set r_(L) = (t_(L) + i} mod q_(L) set y = (r₁ + r₂ + ••• + r_(L)) mod 2 OUTPUT: y

The output y is called a bit output. The ith element oƒ([q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(L),t_(L)])'s truth table is stored in the variable y when machine procedure 2 halts. The execution of machine procedure 2 is presented in a serial form. Nevertheless, the computation of the L instructions set r_(k)=(t_(k)+i) mod q_(k), where 1≤k≤L, can be executed in parallel when there is a separate physical device for each of these L prime clocks [q₁, t₁], [q₂, t₂] . . . [q_(L),t_(L)]. Subsequently, the parity of y can be determined in a second computational step that executes a parallel add of r₁+r₂+ . . . +r_(L), followed by setting y to the least significant bit of the sum r₁+r₂+ . . . +r_(L).

In an embodiment, clock machine 302 in FIG. 3 represents machine procedure 2. In machine procedure 2 clocks [q₁, t₁], [q₂, t₂], . . . [q_(L),t_(L)] are shown in Clocks 306 of FIG. 3. In machine procedure 2, the instructions

set  r₁ = (t₁ + i)mod q₁ set  r₂ = (t₂ + i)mod q₂ … set  r_(L) = (t_(L) + i)mod q_(L) are represented by Adding Instructions 308 and Modulo Instructions 310 in FIG. 3. In FIG. 3, Modulo Instructions 310 also represent the instruction set y=(r₁+r₂+ . . . +r_(L)) mod 2 in machine procedure 2. Furthermore, FIG. 3 represents both virtual machine embodiments and hardware embodiments of machine procedure 2.

In some embodiments, machine procedure 2 is coded in a programming language such as C, Python, JAVA, Haskell, LISP or Ruby and executes as a virtual machine on an operating system such as Android, Apple OS, Linux, Unix, or Windows. In other embodiments, machine procedure 2 can be coded in a programming language such as C or Python and then compiled to execute on an field programmable gate array (FPGA). FPGA hardware has the computational capability to execute one or more clock machines in parallel.

An n-bit exclusive-OR on n bits b₁, b₂, . . . b_(n) is denoted as b₁⊕b₂⊕ . . . b_(n). Furthermore, if an even number of these n-bits are 1, then b₁⊕b₂⊕ . . . b_(n)=0; if an odd number of these n-bits are 1, then b₁⊕b₂⊕ . . . b_(n)=1.

As an alternative implementation of machine procedure 2, when there is a more suitable physical device for prime clocks, the kth clock can compute the kth bit b_(k)=((t_(k)+i)mod q_(k)) mod 2 and then an L-bit exclusive-or can be applied in parallel [34] to the bits b₁, b₂, . . . , b_(L).

EXAMPLE

This example demonstrates 2-bit multiplication with prime clock sums, computed with machine procedure 2. In table 6, for each u∈{0, 1}² and each l∈{0, 1}², the product u*l is shown in each row, whose 4 columns are labelled by

₃,

₂,

₁ and

₀. With input i of 4 bits (i.e., u concatenated with l), the output of the 2-bit multiplication is a 4-bit string

₃(i)

₂(i)

₁(i)

₀(i), shown in each row of table 6.

One can verify that the function

₀:{0, 1}²×{0, 1}²→{0, 1} can be computed with the prime clock sum [2, 0]⊕[7, 3]⊕[7, 4]⊕[7, 5]⊕[11, 10], according to machine procedure 2. Similarly, the Boolean function

₁ can be computed with the prime clock sum [2, 0]⊕[2, 1]⊕[3, 0]⊕[5, 2]⊕[11, 0]⊕[11, 1], according to machine procedure 2. The Boolean function

₂ can be computed with the prime clock sum [5, 0]⊕[7, 0]⊕[7, 2]⊕[11, 4]. Lastly, the function

₃ can be computed with the prime clock sum [2, 1]⊕[5, 0]⊕[11,1]⊕[11,6].

As described in machine specifications 1, 2, 3 and 5 and as shown in table 3, one or more clock machines may also perform computations that are not (beyond) Boolean functions. Machine procedure 3 uses L clock machines [q₁, t₁], [q₂, t₂] . . . [q_(L), t_(L)] to perform a clock machine computation where the output is one of the 3 distinct time states 0, 1, or 2.

Machine Procedure 3. A Prime Clock Sum in Ω₃ Procedure INPUT: i set r₁ = (t₁ + i) mod q₁ set r₂ = (t₂ + i) mod q₂ . . . set r_(L) = (t_(L) + i) mod q_(L) set y = (r₁ + r₂ + ••• + r_(L)) mod 3 OUTPUT: y is one of three distinct time states 0, 1 or 2

In an embodiment, clock machine 302 in FIG. 3 represents machine procedure 3. In machine procedure 3 clocks [q₁, t₁], [q₂, t₂], . . . [q_(L), t_(L)] are shown in Clocks 306 of FIG. 3. In machine procedure 3, the instructions

set  r₁ = (t₁ + i)mod q₁ set  r₂ = (t₂ + i)mod q₂ … set  r_(L) = (t_(L) + i)mod q_(L) are represented by Adding Instructions 308 and Modulo Instructions 310 in FIG. 3. In FIG. 3, Modulo Instructions 310 also represent the instruction set y=(r₁+r₂+ . . . +r_(L)) mod 3 in machine procedure 3. Furthermore, FIG. 3 represents both virtual machine embodiments and hardware embodiments of machine procedure 3.

Similar to table 3, machine procedure 4 uses L clock machines [q₁, t₁], [q₂, t₂] . . . [q_(L), t_(L)] to perform a clock machine computation where the output is one of the 5 distinct time states 0, 1, 2, 3, or 4.

Machine Procedure 4. A Prime Clock Sum in Ω₅ Procedure INPUT: i set r₁ = (t₁ + i) mod q₁ set r₂ = (t₂ + i) mod q₂ . . . set r_(L) = (t_(L) + i} mod q_(L) set y = (r₁ + r₂ + ••• + r_(L)) mod 5 OUTPUT: y is one of five distinct time states 0, 1, 2, 3, or 4

In an embodiment, clock machine 302 in FIG. 3 represents machine procedure 4. In machine procedure 4 clocks [q₁, t₁], [q₂, t₂], . . . [q_(L), t_(L)] are shown in Clocks 306 of FIG. 3. In machine procedure 4, the instructions

$\begin{matrix} {set} & {r_{1} = {\left( {t_{1} + i} \right){mod}\; q_{1}}} \\ {set} & {r_{2} = {\left( {t_{2} + i} \right){mod}\; q_{2}}} \\ \ldots & \; \\ {set} & {r_{L} = {\left( {t_{L} + i} \right){mod}\; q_{L}}} \end{matrix}$ are represented by Adding Instructions 308 and Modulo Instructions 310 in FIG. 3. In FIG. 3, Modulo Instructions 310 also represent the instruction set y=(r₁+r₂+ . . . +r_(L)) mod 5 in machine procedure 4. Furthermore, FIG. 3 represents both virtual machine embodiments and hardware embodiments of machine procedure 4. 6.7 Random Clock Machines that Execute the Midori Cipher

This section of the specification demonstrates how to execute the lightweight cipher Midori [4] with random prime clock machines. In some embodiments, clock machines can execute directly in semiconductor hardware. FIGS. 4A, 4B, 4C and 4D show how to implement a clock machine directly in hardware, using D-type flip flops.

The purpose of randomly generating the clock machines is to help provide greybox protection. In this specification, the greybox model assumes that the adversary Eve can observe the electromagnetic signal emitted from the processor chip executing the computer instructions and Eve knows the cryptographic algorithm executed (e.g., Midori cipher). In some embodiments, Eve does not have realtime, direct access to the prime clock machines executing a cryptographic algorithm. In some embodiments, greybox protection can help make key recovery attacks more difficult for the adversary.

6.8 A Description of the Midori Cipher

Midori consists of two different block ciphers: Midori64 and Midori128. Both use 128-bit keys. Midori64 has block size n=64. In function notation, Midori64: {0, 1}⁶⁴×{0, 1}¹²⁸→{0, 1}⁶⁴. The set {0, 1}⁶⁴ represents 64-bit blocks selected from the message space and {0,1}¹²⁸ is the key space. Midori128 has block size n=128, where Midori128: {0, 1}¹²⁸×{0, 1}¹²⁸→{0, 1}¹²⁸. The first set {0, 1}¹²⁸ in the Cartesian product represents the 128-bit blocks selected from the message space and the second set {0, 1}¹²⁸ is the key space. Table 7 shows a summary of these Midori parameters.

Midori is a variant of a Substitution-Permutation Network cipher that has an S-layer, a P-layer and has a 4×4 data structure as the state:

$S = \begin{pmatrix} s_{0} & s_{4} & s_{8} & s_{12} \\ s_{1} & s_{5} & s_{9} & s_{13} \\ s_{2} & s_{6} & s_{10} & s_{14} \\ s_{3} & s_{7} & s_{11} & s_{15} \end{pmatrix}$

Each element (cell) s_(i) of the state is 4 bits in Midori64 and 8 bits in Midori128. Before Midori64 encrypts a 64-bit block, the 64-bit plaintext M is stored in the state. Similarly, before Midori128 encrypts a 128-bit block, the 128-bit plaintext M is stored in the state. After the ith round, the output state is S_(i). The 0th state S₀=M since no rounds have been computed when i=0.

Next, this section describes how Midori64 and Midori128 compute their nonlinear operations. Midori64 uses the bijective 4-bit S-box S₀: {0, 1}⁴→{0,1}⁴ which is defined in table 8 by the row labelled with S₀(x). Table 8 is interpreted based on the correspondence 0

0000, 1

1000, 2

0100, 3

1100, 4

0010, 5

1010, 6

0110, 7

1110, 8

0001, 9

1001, a

0101, b

1101, c

0011, d

1011, e

0111, ƒ

1111. From the sixteenth column of table 8, S₀(e)=4 corresponds to S₀(0111)=0010.

Similarly, Midori128 uses the bijective 4-bit S-box S₁:{0, 1}⁴→{0,1}⁴ which is defined in table 8 by the row labelled with S₁(x). A bijective function ƒ:X→X is called an involution if ƒ is its own inverse. In other words, ƒ∘ƒ(x)=x for every x∈X. Both S₀ and S₁ are involutions.

The concatenation operation ∥ on two strings can be extended to functions. Define the concatenation operator ∥ on S₁ where S₁∥S₁:{0,1}⁸→{0, 1}⁸ is defined as S₁∥S₁(x₀x₁x₂x₃x₄x₅x₆x₇)=S₁(x₀x₁x₂x₃)∥S₁(x₄x₅x₆x₇). since (S₁∥S₁)∘(S₁∥S₁)=(S₁∘S₁)∥(S₁∘S₁), this implies S_(s)∥S₁ is also an involution.

Midori128 uses four 8-bit substitution boxes

₀,

₁,

₂, and

₃, where each

_(i):{0, 1}⁸→{0, 1}⁸. For each i∈{0, 1, 2, 3}, the substitution box

_(i) is computed as

_(i)σ_(i) ⁻¹∘(S₁∥S₁)∘σ_(i), where S₁ is defined in table 8 and the four permutations σ₂:{0, 1}⁸→{0, 1}⁸ are defined below. First, σ₀(x₀x₁x₂x₃x₄x₅x₆x₇)=x₄x₁x₆x₃x₀x₅x₂x₇. Expressed as a product of disjoint cycles, σ₀=(0 4)(2 6). Permutation σ₁=(0 3 6 1)(2 5 4 7). Permutation σ₂=(0 6 4 2)(1 3)(5 7). Permutation σ₃=(0 5 6 7)(1 2 3 4). Now

∘

_(i)=σ_(i) ⁻¹∘(S₁∥S₁)∘σ_(i)∘σ_(i) ⁻¹∘(S₁∥S₁)∘σ_(i) is the identity map since S₁∥S₁ is an involution. Thus, each

_(i) is an involution.

Lastly, in order to compute the round function, the following matrix is needed

$M = {\begin{pmatrix} 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 0 \end{pmatrix}.}$ 6.9 Midori Round Function

The round function is comprised of an S-layer SubCell: {0, 1}^(n)→{0, 1}^(n) a P-layer ShuffleCell and MixColumn: {0,1}^(n)→{0, 1}^(n) and a key-addition layer KeyAdd: {0, 1}^(n)×{0, 1}^(n)→{0,1}n. Each of these layers updates the n-bit state S according to the following 4 steps.

-   -   1. SubCell(S): In parallel for Midori64, S-box S₀ is applied to         each 4-bit cell of the state S. That is, each cell is updated as         s_(i)←S₀(s_(i)). In parallel for Midori128, S-box         _((i mod 4)) is applied to each 8-bit cell of the state S. That         is, each cell is updated as s_(i)←         _((i mod 4))(s_(i)) where 0≤i≤15.     -   2. ShuffleCell(S): Expressed as disjoint cycles, τ=(s₁ s₇ s₁₂         s₁₀)(s₂ s₁₄ s₄ s₅)(s₃ s₉ s₈ s₁₅)(s₆ s₁₁). Each cell s_(i), where         0≤i≤15, of the state is permuted by τ.     -   3. MixColumn(S): Matrix M is applied to every 4m-bit column of         the state S. That is, for each i∈{0, 4, 8, 12}

$\left. \begin{pmatrix} s_{i} \\ s_{i + 1} \\ s_{i + 2} \\ s_{i + 3} \end{pmatrix}\leftarrow{\begin{pmatrix} 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 0 \end{pmatrix}\begin{pmatrix} s_{i} \\ s_{i + 1} \\ s_{i + 2} \\ s_{i + 3} \end{pmatrix}} \right.$

-   -   4. KeyAdd(S, R_(i)): The ith n-bit round key R_(i) is XORed with         the state S.

The round function is executed for Midori64 and Midori128 sixteen and twenty times, respectively.

6.10 Midori Round Key Generation

For Midori64, the 128-bit secret key K is denoted as the concatenation of two 64-bit keys K₀ and K₁, where K=K₀∥K₁. The 64-bit key W=K₀⊕K₁ and the 64-bit round key R_(i)=K_((i mod 2))⊕α_(i) where 0≤i≤14. Note that α_(i)=β_(i) for 0≤i≤14, where the round constants β_(i) are defined in table 9. The constants α_(i) are added bitwise to the LSB of every round key nibble.

For Midori128, the 128-bit key W=K and the 128-bit round key R_(i)=K⊕β_(i), for 0≤i≤18. In table 9, the constants β_(i) are 4×4 binary matrices. The constants β_(i) are added bitwise to the LSB of every round key byte.

6.11 Executing the Midori Cipher with a Clock Machine

As discussed above, the S-box S₀ and the S-box S₁ are fundamental building blocks for the nonlinear operations in Midori64 and Midori128, respectively. Tables 10 and 11 show functions constructed from S-boxes S₀ and S₁ and the four projection functions π_(i):{0, 1}⁴→{0,1} where π_(i)(x₀x₁x₂x₃)=x_(i) for each i∈{0, 1, 2, 3}. For example, in table 10, π₃∘S₀(7)=0. This is computed by reading from table 8 that S₀(7)=7; using the correspondence 7

1110; and then π₃ selecting the x₃ bit from 1110.

Prime clock sum [2, 1]⊕[3, 2]⊕[5, 2]⊕[17, 16] is located in the first row and last column of table 10. When machine 1 is executed, ([2,1]⊕[3, 2]⊕[5, 2]⊕[17, 16])(7)=([2, 1](7)+[3, 2](7)+[5, 2](7)+[17, 16](7)) mod 2=0. Thus, prime clock sum [2, 1]⊕[3, 2]⊕[5, 2]⊕[17, 16](7) computes π∘S₀(7) and has complexity 24.

As another example of a prime clock machine execution, in table 11, π₂∘S₁ (4)=1. This is computed by reading from table 8 that S₁(4)=e; using the correspondence e

0111; and then π₂ selecting the the x₂ bit from 0111. The corresponding prime clock sum is applied to 4. ([2,1]⊕[7, 6]⊕[11, 0]⊕[13, 3]⊕[17, 10])(4)=(1+3+4+7+14) mod 2=1.

The prime clock sums in tables 10 and 11 were computed by machine procedure 5 that randomly builds p-clock sums from the first 8 primes {2, 3, 5, 7, 11, 13, 17, 19}. Overall, from sections 6.8 and 6.9, it is straight-forward to build SubCell(S) function, based on the prime clock sums in tables 10 and 11.

Next we turn to the linear operations used in Midori64 and Midori128. First, observe that the other three layers ShuffleCell(S), MixColumn(S), and KeyAdd(S) can be constructed from affine Boolean functions.

ShuffleCell(S) is a permutation τ of the state S, where τ=(s₁ s₇ s₁₂ s₁₀)(s₂ s₁₄ s₄ s₅)(s₃ s₉ s₈ s₁₅)(s₆ s₁₁). In Midori64 τ:{0,1}⁶⁴→{0,1}⁶⁴, where τ(x)=(τ₀(x), (x), τ₁(s), . . . , τ₆₃(s)) and each τ_(i):{0, 1}⁶⁴→{0, 1} is an affine function. In Midori128, τ:{0, 1}¹²⁸→{0, 1}¹²⁸, where τ(x)=(τ₀(x), . . . τ₁₂₇(x)) and each τ_(i):{0, 1}¹²⁸→{0, 1} is an affine function.

In MixColumn(S), each row×column multiplication in the matrix multiplication is a dot product on the vector space over

₂. For example, the first row of M corresponds to the affine map A_(0111,0), which is defined in table 13.

In KeyAdd(S, R_(i)), each R_(i) is built from a different constant from table 9 and XOR'd with the state, so KeyAdd(S, R_(i)) is also composed of affine Boolean functions.

Table 13 shows a list of every affine map A_(a) ₀ _(a) ₁ _(a) ₂ _(a) ₃ _(,c):{0, 1}⁴→{0, 1} such that c=0. In the last column, the specified affine map is computed by a random prime clock sum machine built from the 8 primes {2, 3, 5, 7, 11, 13, 19}. The affine maps A_(z) ₀ _(a) ₁ _(a) ₂ _(a) ₃ _(,1):{0, 1}⁴→{0, 1} can be constructed by adding prime clock sum machine [2, 0]⊕[2, 1] to each of the prime clock sum machines in table 13. This machine composition works because

A_(a) ₀ _(a) ₁ _(a) ₂ _(a) ₃ _(,0)=A_(a) ₀ _(a) ₁ _(a) ₂ _(a) ₃ _(,1) and ([2, 0]⊕[2, 1])(m)=1 for every number m∈

.

Overall, the Midori cipher can be executed with prime clocks chosen from the first 8 primes. Of the first 8 primes, {5,13, 17} are the 1 mod 4 primes. Define function α₄ on the primes as follow. Iƒ(p>16) then α₄(p)=16. If p<16 and p is a 1 mod 4 prime then α₄(p)=p−1. If p<16 and p is a 3 mod 4 prime or p=2, then α₄(p)=p. There are 2² ⁴ =2¹⁶ distinct Boolean functions ƒ:{0,1}⁴→{0, 1}. 2²⁺³⁺⁽⁵⁻¹⁾⁺⁷=2¹⁶, so prime clock sums, constructed from the first 4 primes, can compute any Boolean function ƒ:{0, 1}⁴→{0,1}. Note that

${2{\sum\limits_{i = 1}^{8}\;{\alpha_{4}\left( p_{i} \right)}}} = {2^{16}{2^{56}.}}$

In section 6.14, machine lemma 3 and machine corollaries 5 and 7 imply that for each ƒ:{0, 1}⁴→{0,1}, there are 2⁵⁶ different prime clock sums, constructed from the first 8 primes, that compute ƒ. Note 2⁵⁶>10¹⁶. Thus, each processor chip could be programmed with a unique collection of random prime clock sums that compute the Midori cipher such that the probability of two distinct processor chips computing the Midori cipher with identical random prime clock sums over the primes {p₁, p₂, . . . , p₈} is substantially less than 10⁻⁹. A unique computational footprint for each chip can substantially obfuscate the execution of the Midori cipher and also break up any type of timing patterns during the cipher's execution.

6.12 Random Clock Machines

This section describes machine procedure 5 that uses randomness for finding a clock machine that computes ƒ:{0, 1}n→{0, 1}. In an embodiment, random clock machines are chosen, using non-deterministic process 542 in FIG. 5A. In an embodiment, random clock machines are chosen, using non-deterministic process 552 in FIG. 5B. After the machine procedure 5 description, an augmentation is described that can help substantially increase the process speed for constructing prime clock machines that compute ƒ. In an embodiment, 64 distinct ƒ's: ƒ₀, ƒ₁, ƒ₂, . . . , ƒ₆₃ that compute the addition of two 64-bit numbers in binary.

Some parameters are passed into the probabilistic machine and also a computable representation as either a software or hardware embodiment of Boolean function ƒ. The purpose is to be able to compute ƒ(x) on every input x∈{0, 1}^(n). A distance metric H, computed as a machine, between 2 functions is also needed.

Let Q be a prime clock sum machine. Let ƒ be a computable representation of Boolean function ƒ: {0, 1}^(n)→{0, 1}. The function ƒ⊕Q:{0,1}^(n)→{0, 1} is defined as ƒ(x)⊕Q(x). Define the Hamming distance between these two functions as H(Q, ƒ)=⊕Q)⁻¹{1}1, where inverse image (ƒ⊕Q)⁻¹{1}={x∈{0,1}^(n):ƒ(x)⊕Q(x)=1}. If H(Q, ƒ)=0, then Q(x)=ƒ(x) for every x in {0, 1}^(n).

The first parameter passed in is a positive integer u. u is an upper bound on the index of the primes to use for selecting prime clocks. For example, if u=6, then machine procedure 5 builds clock machines from the primes {2, 3, 5, 7, 11, 13}.

The second and third parameters passed in are r_(lb) and r_(ub) such that r_(lb)≤r_(ub), which create a range of values for the number of random prime clocks to use to build prime clock machine Q. The fourth parameter passed in is s, which is the number of different random prime clocks machines to build for each value of r in {r_(lb), r_(lb)+1, . . . , r_(ub)}. The fifth parameter passed in is n.

Machine Procedure 5. Random Prime Clock Machines that Compute f set r = r_(lb) $m = \frac{n}{2}$ while (r ≤ r_(ub)) {  set c = 0  while (c ≤ s)  {   set k = 0   while (k ≤ r)   {    choose a random integer i in [1, u]    choose a random integer t in [0, p_(i) − 1]    if k = 0 set Q = [p_(i), t]    else set Q = Q ⊕ [p_(i), t]    increment k   }   set h = H(Q, f)   if (h = 0) return Q_(best)   else if (h = n) return [2, 0] ⊕ [2, 1] ⊕ Q   if (h < m)   {    set prime clock sum machine Q_(best) = Q    set m = h   }   increment c  }  increment r } return Q_(best)

In an embodiment, non-deterministic process 542 or non-deterministic process 552 in FIG. 5B are used to help implement the instructions

-   -   choose a random integer i in [1, u]     -   choose a random integer t in [0, p_(i)−1]         in machine procedure 5. In an embodiment, non-deterministic         process 542 or non-deterministic process 552 help the first         instruction randomly choose p_(i). Recall that p_(i) is the         number of distinct time states in the randomly constructed clock         machine. In an embodiment, non-deterministic process 542 or         non-deterministic process 552 help the second instruction         randomly choose t, which is the starting time state in clock         machine [p_(i), t].

The search process time for machine Q_(best) can be substantially reduced by passing in a small s; and then exiting machine 5 with prime clock machine Q_(best) and then repairing Q_(best) at x such that Q_(best)(x)⊕ƒ(x)=1. As an example, for n=4, suppose that the computation Q_(best)(12)⊕ƒ(12)=1, then repair machine Q_(best) by updating it to prime clock sum machine [2, 0]⊕[2, 1]⊕[17, 6]⊕[17, 7]⊕Q_(best). If Q_(best)(i)⊕ƒ(i)=1 at i=10 and i=11, then update Q_(best) to [17, 5]⊕[17, 7]⊕Q_(best). A similar repair machine can be used for larger n with a prime p>2^(n).

6.13 Timing Differences in Clock Machines

The purpose of this section is to better understand timing differences that occur when different instances of machine procedures 1 are executed. It is well-known in the prior art that timing differences can be exploited to capture a key from a cryptographic cipher and break the cryptography. (See [5, 20].) In the prior art, standard digital computers often have timing differences due to branch instructions. There are two places in the execution of machine procedure 1 where timing differences could occur:

-   -   1. The size of r is the number of clocks in the prime clock sum.     -   2. The two instructions set e=(t_(k)+x) mod q_(k) and set e=e         mod 2 depend upon q_(k), t_(k) and x.

The other instructions such as set y=(y+e) mod 2 should exhibit no timing differences because both y and e store 0 or 1 and y{circumflex over ( )}=e; is the C source code for this mathematical operation.

For these reasons, the Intel timestamp instruction RDTSC [17] was called to measure timing differences with b−a, as shown in the following C source code. The value b−a is the number of Intel CPU clock cycles that occur during the CPU's execution of the two instructions e=(t+x) % p; and e&=1;

static _—inline_— unsigned long long rdtsc(void) { unsigned hi, lo; _—asm_— _—volatile_— (“RDTSC” : “=a”(lo), “=d”(hi)); return ( (unsigned long long) lo) | (((unsigned long long) hi) << 32); } unsigned long long a, b; for(x = 0; x < 65535; x++) { for(t = 0; t < p; t++) { a = rdtsc( ); e = (t + x) % p; e &= 1; b = rdtsc( ); } }

A 2.5 GHz Intel Core i5 CPU executed for these timing tests. Our timing results were measured on the first 100 primes p; on each prime clock ticking time t such that 0≤t<p; and all 16-bit input values x. For a fixed triplet (p, t, x), the CPU clock cycles timing difference b−a was measured on 1000 samples.

In table 12, the range [24, 25] in the 2-clock column indicates that 95 percent of the measurements b−a satisfied 24≤b−a≤25 over all of the 2-clock machine tests. The same ranges of [23, 25] or [24, 25] were also obtained for the remaining 92 primes {23, 29, . . . , 523, 541}.

In some embodiments, timing tests for prime clock machines executing in semiconductor hardware suggest that the number of clocks (parameter r in algorithm 1) in the sum is the primary influence on execution time. In some embodiments, prime clocks execute in parallel to help eliminate timing differences.

An alternative embodiment varies the number of clocks for each random prime clock sum machine instantiation in hardware: in the greybox model, Eve would not know for a particular processor chip how many prime clocks are used to implement the S₀ or S₁ S-boxes or the number of clocks used to implement one of the affine maps that compose the ShuffleCell(S), MixColumn(S) or KeyAdd(S) layers.

6.14 Clock Machine Properties and Theorems

This section provides further specifications, properties and proofs about prime clock machines and in particular finite prime clock machines executing in Ω₂. The intermediate results work toward the theorem 8, stated in the introduction: For any positive integer n, for each of the 2² ^(n) Boolean functions ƒ:{0, 1}^(n)→{0, 1}, there exists a finite sum of prime clock machines executing in Ω₂ that can compute ƒ. Because universal computing machines [29, 30] can be computed using Boolean functions as building blocks, this means that universal computing machines can be constructed from prime clock machines.

First, a remark is proven that was cited in section 6.5.

Machine Remark 1. (m₁+m₂) mod n=((m₁ mod n)+(m₂ mod n)) mod n.

PROOF. Euclid's division algorithm implies that m₁=k₁n+r₁ and m₂=k₂n+r₂, where 0≤r₁, r₂<n. Now (m₁+m₂)mod n=((k₁+k₂)n+r₁+r₂) mod n=(r₁+r₂) mod n=((m₁ mod n)+(m₂ mod n)) mod n □

The following equivalence relation on

induced by a function ƒ∈Ω_(n) helps characterize prime clock sums.

Machine Specification 6. For any ƒ∈Ω_(n), define the relation

on

such that x

y if and only if for all m∈

, ƒ(m)=ƒ(m+|y−s|).

Trivially,

is reflexive and symmetric. Next, transitivity of

is verified. Suppose

and

. W.L.O.G., suppose x≤y≤z. (The other orderings of x, y and z can be handled by permuting x, y and z in the following steps.) This means for all m∈

, ƒ(m+z−x)=ƒ(m); and for all k∈

, ƒ(k)=ƒ(k+z−y). This implies that for all m∈

, ƒ(m+z−x)=ƒ(m+z−y+y−x)=ƒ(m+y+x)=ƒ(m).

Machine Remark 2.

is an equivalence relation.

Machine Specification 7. Periodic Functions

ƒ∈Ω_(n) is a periodic function if there exists a positive integer b such that for every m∈

, then ƒ(m)=ƒ(m+b). Furthermore, if a is the smallest positive integer such that ƒ(m)=ƒ(m+a) for all m∈

, then a is called the period of ƒ. After k substitutions of m+a for m, this implies for any m∈

that ƒ(m)=ƒ(m+ka) for all positive integers k.

As shown in table 1, both prime clocks [2, 0] and [2, 1] projected into Ω₂ have period 2. Both prime clock machines [3, 0] and [3, 1] projected into Ω₂ have period 3. Each prime clock sum [2, 0]⊕[3, 0], [2, 1]⊕[3, 0] and [2, 0]⊕[3, 1] has period 6.

When ƒ is periodic with period a, each equivalence class is of the form [k]={k+ma:m∈

}, where 0≤k<a. Thus, ƒ has period a implies there are a distinct equivalence classes on N with respect to

.

Machine Remark 3. If a is the period of ƒ and b is a positive integer such that ƒ(m)=ƒ(m+b) for all m∈

, then a divides b.

PROOF. First, verify that

. By the definition of period, a≤b and for all m∈

, then ƒ(m+b−a)=ƒ(m+a+b+a)=ƒ(m+b)=ƒ(m). From the prior observation, a lies in [0] and b also lies in [0]. Thus, b=ma for some positive integer m.

Machine Lemma 1. If ƒ, g∈Ω_(n) are periodic, then ƒ⊕_(n)g is periodic. Further, if the period of ƒ is a and the period of g is b, then ƒ⊕_(n)g has a period that divides lcm(a, b).

PROOF. Let a be the period of ƒ and b the period of g. Let l_(a,b)=lcm(a, b). l_(a,b)=ia and l_(a,b)=jb for positive integers i, j. For any m∈

, (ƒ⊕_(n)g)(m)=ƒ(m)+_(n)g(m)=ƒ(m+ia)+_(n)g(m+jb)=ƒ(m, l_(a,b))+_(n)g(m+l_(a,b))=(ƒ⊕_(n)g)(m+l_(a,b)). Thus, ƒ⊕_(n)g is periodic and remark 3 implies its period divides l_(a,b).□

In regard to lemma 1, if g=−ƒ, then the period of ƒ⊕_(n)g is 1.

Machine Remark 4. There are n^(a) distinct periodic functions ƒ∈Ω_(n) whose period divides a.

PROOF. Since ƒ is periodic and its period divides a, the values of ƒ(0), ƒ(1), . . . , ƒ(a−1) uniquely determine ƒ. There are n choices for ƒ(0). There are n choices for ƒ(1), and so on.

Periodic functions with prime periods are straightforward to count.

Machine Remark 5. Suppose p is prime. There are n^(p)−n distinct periodic functions ƒ∈Ω_(n) with period p.

PROOF. Consider a finite sequence c₀, c₁, . . . , c_(p−1) of length p where each c_(i)∈

_(n). This sequence uniquely determines a periodic ƒ such that ƒ(m=p)=ƒ(m) for all m∈

. In particular, ƒ(0)=c₀, ƒ(1)=c₁, . . . , ƒ(p−1)=c_(p−1). There are n^(p) periodic functions with a period that divides p. If the period of ƒ is less than p, then remark 3 implies ƒ has period 1 since p is prime. There are n distinct, constant (period 1) functions in Ω_(n). Thus, the remaining n^(p)−n periodic functions have period p.

Machine Remark 6. The prime clock [p, t], projected into Ω_(n), has period p.

PROOF. Since p is prime, this follows immediately from remark 3.

Machine Theorem 2. Finite Prime Clock Sums are Periodic

Any finite sum of prime clock machines [q₁,t₁]⊕_(n)[q₂, t₂]⊕_(n) . . . ⊕_(n)[q_(l), t_(l)] is periodic.

PROOF. Use induction and apply remark 6 and lemma 1.

The following statements are restricted to Ω₂.

Machine Remark 7. [p, t]⊕[p, t]=0 for any prime clock [p, t].

Per definition 2, ([p, k]⊕[p, k])(m)=([p, k](m)+[p, k](m)) mod 2=0 in

₂.

Let ƒ∈Ω_(n). If ƒ is a constant function where ƒ(m)=c for all m∈

, then the expression ƒ=c indicates this.

Machine Remark 8. Let p be an odd prime. If p is a 3 mod 4 prime, then prime clock machine [p, 0]⊕[p, 1]⊕ . . . ⊕[p, p−1]=1. If p is a 1 mod 4 prime, then prime clock machine [p, 0]⊕[p, 1]⊕ . . . ⊕[p, p−1]=0.

PROOF. ([p, 0]⊕[p, 1]⊕ . . . ⊕[p, p−1])(0)=(0+1+ . . . +p−1) mod 2=½(p−1)p mod 2. For each m>0, ([p, 0]⊕[p, 1]⊕ . . . ⊕[p, p−1])(m) is a permutation of the sum inside (0+1+ . . . +p−1) mod 2. □ For the special case p=2, observe that [2, 0]⊕[2, 1]=1.

Machine Specification 8. A finite sum [q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(l), t_(l)] machine of prime clocks is non-repeating is i≠j implies [q_(i), t_(i)] is not equal to [q_(j), t_(j)].

Machine Remark 9. Any finite sum [q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(l), t_(l)] of prime clock machines in Ω₂ can be reduced to a non-repeating finite sum [q_(i) ₁ , t_(i) ₁ ]⊕[q_(i) ₂ , t_(i) ₂ ]⊕ . . . ⊕[q_(i) _(r) , t_(i) _(r) ], where r≤l such that for any m∈

, ([q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(l), t_(l)])(m)=([q_(i) ₁ , t_(i) ₁ ]⊕[q_(i) ₂ , t_(i) ₂ ]⊕ . . . ⊕[q_(i) _(r) , t_(i) _(r) ])(m).

Since (Ω₂, ⊕₂) is abelian, if necessary, rearrange the order of [q₁, t₁]⊕[q₂, t₂]⊕ . . . ⊕[q_(l),t_(l)], so that the prime clocks are ordered using the dictionary order. If two or more adjacent prime clocks are equal, then the associative property and remark 7 enables the cancellation of even numbers of equal prime clocks. This reduction can be performed a finite number of times so that the resulting sum is non-repeating. □

Machine Specification 9. Let p be a prime. A finite sum of prime clock machines [p, t₁]⊕[p, t₂]⊕ . . . [p, t_(l−1)]⊕[p, t_(l)] is called a p-clock sum of length l if for each 1≤i≤l, the clock [p, t_(i)] is a p-clock machine and the sum is non-repeating. The non-repeating condition implies l≤p. Machine Lemma 3. Let p be a prime. A p-clock machine sum with length p has period 1. A p-clock machine sum with length l such that 1≤l<p has period p.

PROOF. When p=2, the 2-clock sum [2, 0] has period 2 and the 2-clock sum [2, 1] also has period 2. Recall that [2, 0]⊕[2, 1]=1. For the remainder of the proof, it is assumed that p is an odd prime.

Let [p, t₁]⊕[p, t₂]⊕ . . . [p, t_(l−1)]⊕[p, t_(l)] be a p-clock sum. When l=p, remark 8 implies that [p, t₁]⊕[p, t₂]⊕ . . . [p, t_(l−1]⊕[)p, t_(l)] has period 1. Lemma 1 and remark 6 imply that [p, t₁]⊕[p, t₂]⊕ . . . [p, t_(l−1)]⊕[p, t_(l)] has period p or period 1. The rest of this proof shows that 1≤l≤p−1 implies that the p-clock sum cannot have period 1.

Thus, it suffices to show that 1≤l<p implies that ([p, t₁]⊕[p, t₂]⊕ . . . ⊕[p, t_(l)])(m)≠([p, t₁]⊕[p, t₂]⊕ . . . ⊕[p, t_(l)])(m+1) for some m∈

. If needed, the p-clock sum may be permuted so that [p, s₁]⊕[p, s₂]⊕ . . . ⊕[p, s_(l)]=[p, t₁]⊕[p, t₂]⊕ . . . ⊕[p, t_(l)] and the s_(i) are strictly increasingly. Strictly increasing means 0≤s₁<s₂ . . . s_(l−1)<s_(l)≤p−1.

Case A. l is odd. If s_(l)<p−1, then

${\left( {\left\lbrack {p,s_{1}} \right\rbrack \oplus \left\lbrack {p,s_{2}} \right\rbrack \oplus \ldots \oplus \left\lbrack {p,s_{l}} \right\rbrack} \right)(0)} = {{{\sum\limits_{i = 1}^{l}{s_{i}{mod2}}} \neq {\sum\limits_{i = 1}^{l}{\left( {s_{i} + 1} \right)\;{mod2}}}} = {\left\lbrack {p,s_{1}} \right\rbrack \oplus \left\lbrack {p,s_{2}} \right\rbrack \oplus \ldots \oplus {\left\lbrack {p,s_{l}} \right\rbrack(1)}}}$ because l is odd.

Otherwise, s_(l)=p−1. Set s₀=0. (The auxiliary index s₀=0 handles the case s_(k+1)−s_(k) for all k such that 1≤k<l.) Set m=max{k∈

: s_(k+1)−s_(k)≥2 and 0≤k<l}. Since s₀=0 and 1≤l<p, the pigeonhole principle implies m exists. Before the mod 2 step, the difference between

$\sum\limits_{i = 1}^{l}{\left( {\left( {s_{i} + l - m + 1} \right){mod}\; p} \right)\mspace{14mu}{and}\mspace{14mu}{\sum\limits_{i = 1}^{l}\left( {\left( {s_{i} + l - m} \right){mod}\; p} \right)}}$ equals l. Thus, ([p, s₁]⊕[p, s₂]⊕ . . . ⊕[p, s_(l)])(l−m)≠([p, s₁]⊕[p, s₂]⊕ . . . ⊕[p, s_(l)])(l−m+1).

Case B. l is even. Set j=(p−1)−s_(l). Before the mod 2 step, the sum

$\sum\limits_{i = 1}^{l}\left( {\left( {s_{i} + j} \right){mod}\; p} \right)$ differs from the

${sum}\;{\sum\limits_{i = 1}^{l}\left( {\left( {s_{i} + j + 1} \right){mod}\; p} \right)}$ by an odd number. Thus, ([p, s₁]⊕ . . . ⊕[p, s_(l)])(j)≠([p, s₁]⊕ . . . ⊕[p, s_(l)])(j+1). Machine Specification 10. Let p be prime. The p-clock machine sum [p, s₁]⊕ . . . ⊕[p, s_(l)] is distinct from the p-clock machine sum [p, t₁]⊕ . . . ⊕[p, t_(m)] if l≠m or if for some i, prime clock [p, s_(i)] machine is not an element of the set of machines {[p, t₁], [p, t₂], . . . [p, t_(m)]}.

7-clock sum [7, 2]⊕[7, 3] is distinct from [7, 2]⊕[7, 3]⊕[7, 4]. 7-clock sum [7, 0]⊕[7, 2]⊕[7, 3] is distinct from [7, 1]⊕[7, 2]⊕[7, 3].

Machine Theorem 4. For any 3 mod 4 prime p, if two p-clock sums are distinct, then they are not equal in Ω₂. The theorem also holds for p=2.

PROOF. The special case p=2 is verified by examining columns 2 and 3 of table 1.

Let p be a 3 mod 4 prime. Assume p-clock sum [p, s₁]⊕ . . . ⊕[p, s₁] is distinct from p-clock sum [p, t₁]⊕ . . . [p, t_(m)]. By reductio absurdum, suppose [p,s ₁]⊕ . . . ⊕[p,s _(l)]=[p,t ₁]⊕ . . . ⊕[p,t _(m)].  (6.2)

For each s_(i)∈{t₁, . . . , t_(m)}, the operation ⊕[p, s_(i)] in Ω₂ can be applied to both sides of equation 6.2. Similarly, for each t_(j)∈{s₁, . . . , s_(l)}, the operation ⊕[p, t_(j)] can be applied to both sides of equation 6.2. Since (Ω₂, ⊕) is an abelian group, equation 6.2 can be simplified to [p, s₁]⊕ . . . ⊕[p, s_(L)]=[p, t₁]⊕ . . . ⊕[p, t_(M)] such that {s₁, . . . , s_(L)}∩{t₁, . . . , t_(M)}=∅ and M+L≤p.

Set ƒ=[p, s₁]⊕ . . . ⊕[p, s_(L)]. Apply ƒ⊕ to both sides of [p, s₁]⊕ . . . ⊕[p, s_(L)]=[p, t₁]⊕ . . . ⊕[p, t_(M)]. This simplifies to ƒ⊕[p, t₁]⊕ . . . ⊕[p, t_(M)]=0. Lemma 3 implies that L+M=p. Since L+M=p and {s₁, . . . , s_(L)}∩{t₁, . . . , t_(M)}=∅ and p is a 3 mod 4 prime, remark 8 implies that ƒ⊕[p, t₁]⊕ . . . ⊕[p, t_(M)]=1. This is a contradiction, so [p, s₁]⊕ . . . ⊕[p, s_(l)] is not equal to [p, t₁]⊕ . . . ⊕[p, t_(m)] in Ω₂. □

Let S_(l) be the set of all p-sums of length l, where 1≤l≤p. There are (^(p) _(l)) distinct p-sums in each set S_(l). Set

$G_{p} = {{{\underset{l = 1}{\bigcup\limits^{p}}}_{\;}\mathcal{S}_{l}}\bigcup{\left\{ \overset{\_}{0} \right\}.}}$ For any ƒ, g∈G_(p), remark 7 implies ƒ⊕g⁻¹ in G_(p). Thus, (G_(p), ⊕) is an abelian subgroup of Ω₂.

Set B_(p)={0, 1}^(p). For any a₁ . . . a_(p)∈B_(p) and b₁ . . . b_(p)∈B_(p), define a₁ . . . a_(p)+₂ b₁ . . . b_(p)=c₁ . . . c_(p), where c_(i)=(a_(i)+b_(i)) mod 2. (B_(p), +₂) is an abelian group with 2^(p) elements.

When p is a 3 mod 4 prime, define the group isomorphism ϕ:G_(p)→B_(p) where ϕ(0)=0 . . . 0∈B_(p) and ϕ([p, t₁]⊕[p, t₂]⊕ . . . [p, t_(l)])=c₁ . . . c_(p) where c_(i)=([p, t₁]⊕[p, t₂]⊕ . . . [p, t_(l)])(i).

Machine Corollary 5. Let p be a 3 mod 4 prime. The subgroup G_(p) of Ω₂, generated by the p-clocks [p, 0], [p, 1], . . . [p, p−1] has order 2^(p) and is isomorphic to (B_(p), +₂).

PROOF. Theorem 4 implies ϕ is a group isomorphism.

Theorem 4 does not hold when p is a 1 mod 4 prime. For example, [5, 0]⊕[5, 1] equals [5, 2]⊕[5, 3]⊕[5, 4].

Machine Theorem 6. For any 1 mod 4 prime p, if two p-clock sums are distinct and their lengths are

${{both} \leq \frac{p - 1}{2}},$ when they are not equal in Ω₂.

PROOF. The proof is almost the same as the proof in theorem 4, except the additional condition that

$L \leq {\frac{p - 1}{2}\mspace{14mu}{and}\mspace{14mu} M} \leq \frac{p - 1}{2}$ and reduction [p, s₁]⊕ . . . ⊕[p, s_(L)]⊕[p, t₁]⊕ . . . ⊕[p, t_(M)]=0 leads to an immediate contradiction: L+M≤p−1 and {s₁, . . . , s_(L)}∩{t₁, . . . , t_(M)}=∅ means lemma 3 implies [p, s₁]⊕ . . . ⊕[p, s_(L)]⊕[p, t₁]⊕ . . . ⊕[p, t_(M)] has period p. □ Machine Remark 10. Let p be a 1 mod 4 prime. Let ƒ=[p, s₁]⊕ . . . ⊕[p, s_(l)] for some 1≤l≤½(p−1). Set T={0, 1, . . . , p−1}−{s₁, . . . , s_(l)}. Now T={t₁, . . . t_(m)}, where l+m=p. Set g=[p, t₁]⊕ . . . ⊕[p, t_(m)]. Then ƒ=g in Ω₂.

PROOF. Since p is a 1 mod 4 prime,

${\left( {f \oplus g} \right)(0)} = {{\sum\limits_{0}^{p - 1}\;{k\;{mod}\; 2}} = {0\mspace{14mu}{in}\mspace{14mu}{{\mathbb{Z}}_{2}.}}}$ When k>1, the sum of the elements of ƒ⊕g before projecting into Ω₂ is a permutation of the elements {0, 1, . . . , p−1}. Thus, for all k>1, (ƒ⊕g)(k)=0 in

₂. This means g=ƒ⁻¹. Lastly, ƒ=ƒ⁻¹ in Ω₂, so ƒ=g in Ω₂. □

Let p be a 1 mod 4 prime. Set

$H_{p - 1} = {{{\underset{l = 1}{\bigcup\limits^{\frac{1}{2}{({p - 1})}}}}_{\;}\mathcal{S}_{l}}\bigcup{\left\{ \overset{\_}{0} \right\}.}}$ Observe that

${H_{p - 1}} = {{{{\underset{l = 1}{\sum\limits^{\frac{1}{2}{({p - 1})}}}}_{\;}\begin{pmatrix} p \\ k \end{pmatrix}} + 1} = {2^{p - 1}.}}$ To verify that (H_(p−1), ⊕) is a subgroup oƒ(Ω₂, ⊕), let ƒ, g∈H_(p−1). Since g=g⁻¹ in (Ω₂, ⊕), it suffices to show that ƒ⊕g lies in H_(p−1). If ƒ or g equals 0, closure in (H_(p−1), ⊕) holds. Otherwise, ƒ=[p, s₁]⊕ . . . ⊕[p, s_(l)] for some 1≤l≤½(p−1) and g=[p, t₁]⊕ . . . ⊕[p, t_(m)] for some 1≤m≤½(p−1). As mentioned before, the sum ƒ⊕g may be reduced to [p, s₁]⊕ . . . ⊕[p, s_(L)]⊕[p, t₁]⊕ . . . ⊕[p, t_(M)], where {s₁, . . . , s_(L)}∩{t₁, . . . t_(M)}=∅ and L+M≤p. If L+M≤½(p−1), closure in (H⁻¹, ⊕) holds. Otherwise, if L+M>½(p−1), remark 10 implies that there is a p-sum h=ƒ⊕g, where h's length is p−(L+M) and p−(L+M)≤½(p−1).

Similar to the group isomorphism ϕ, define Ψ: H_(p−1)→B_(p−1) such that Ψ(0)=0 . . . 0∈B_(p). For each p-sum in S_(l), where 1≤l≤½(p−1), define Ψ([p, t₁]⊕[p, t₂]⊕ . . . [p, t_(l)])=c₁ . . . c_(p−1) where c_(i)=([p, t₁]⊕[p, t₂]⊕ . . . [p, t_(l)])(i). It is straightforward to verify that Ψ is a group isomorphism onto B_(p−1). The group isomorphism Ψ:H_(p−1)→B_(p−1) leads to the following corollary.

Machine Corollary 7. Let p be a 1 mod 4 prime. The subgroup H_(p−1) of Ω₂, generated by the p-clock machines [p, 0], [p, 1], . . . [p, p−1] has order 2^(p−1) and is isomorphic to (B_(p−1), +₂).

Machine Theorem 8. Let n be a positive integer. For any of the 2² ^(n) boolean functions ƒ:{0, 1}^(n)→{0, 1}, there exists a finite sum of prime clock machines on Ω₂ that can compute ƒ.

PROOF. This theorem follows immediately from corollaries 5 and 7 along with Euclid's second theorem [15] that the number of primes is infinite. □

Furthermore, finding a finite prime clock machine that computes ƒ can be computed with efficient computational procedures because there are efficient computable algorithms that can decide whether a natural number n is prime.

REFERENCES

-   [1] H. Aiken and G. Hopper. The Automatic Sequence Controlled     Calculator, reprinted in B. Randell, ed., The Origins of Digital     Computers. Berlin: Springer Verlag, 203-222, 1982. -   [2] Jean-Philippe Aumasson, Samuel Neves, Zooko Wilcox-O'Hearn,     Christian Winnerlein. BLAKE. https://131002.net/blake/ -   [3] J. Bardeen and W. H. Brattain. The Transistor, A Semi-Conductor     Triode. Physical Review, 74, 230, Jul. 15, 1948. -   [4] S. Banik, A. Bogdanov, T. Isobe, K. Shibutani, H. Hiwatari, T.     Akishata, F. Regazzoni: Midori: A Block Cipher for Low Energy.     In: T. Iwata, J. H. Cheon (eds.) ASIACRYPT 2015. LNCS, vol. 9453,     pp. 411-436. Springer, Heidelberg (2015) -   [5] Daniel Bernstein. Cache-timing attack on AES. 2005.     http://cr.yp.to/antiforgery/cachetiming-20050414.pdf -   [6] Guido Bertoni, Joan Daemen, Michael Peeters, Gilles Van Assche.     Keccak Reference 3.0 2011.     http://keccak.noekeon.org/http://en.wikipedia.org/wiki/Keccak -   [7] A. W. Burks and A. R. Burks, The ENIAC: First General Purpose     Electronic Computer, Annals of the History of Computing, 3, 4,     310-399, 1981. -   [8] John Conway and Simon Kochen. The Strong Free Will Theorem.     Notices of the American Mathematical Society. 56(2), 226232,     February 2009. -   [9] Stephen Cook. The P VS NP Problem.     http://www.claymath.org/sites/default/files/pvsnp.pdf -   [10] Thomas W. Cusick and Pante Stanica. Cryptographic Boolean     Functions and Applications. Academic Press (2009) -   [11] Niels Ferguson, Stefan Lucks, Bruce Schneier, Doug Whiting,     Mihir Bellare, Tadayoshi Kohno, Jon Callas, Jesse Walker. The Skein     Hash Function Family. 2010. https://www.schneier.com/skein1.3.pdf     http://en.wikipedia.org/wiki/Skein_(hash_function) -   [12] Klint Finley. Chinese Supercomputer Is Still the Worlds Most     Powerful. Wired Magazine. Nov. 18, 2013. -   [13] Praveen Gauravaram, Lars Knudsen, Krystian Matusiewicz, Florian     Mendel, Christian Rechberger, Martin Schlffer, and Sren S. Thomsen.     Grstl a SHA-3 candidate. http://www.groestl.info -   [14] Paul Halmos, S. Givant: Logic as Algebra. The Mathematical     Association of America (1998) -   [15] G. H. Hardy and E. M. Wright: An Introduction to the Theory of     Numbers. Oxford University Press, 6th edition, Oxford (2008) -   [16] J. Hennessy, D. Patterson: Computer Architecture. A     Quantitative Approach. 5th Edition, Elsevier (2012) -   [17] Intel 64 and IA-32 Architectures Software Developers Manual.     April (2016) -   [18] Jack Kilby. Miniaturized Electronic Circuits. U.S. Pat. No.     3,138,743. 1959. -   [19] Simon Kochen and E. P. Specker. The Problem of Hidden Variables     in Quantum Mechanics. Journal of Mathematics and Mechanics. Vol. 17,     No. 1, 5987 (1967) -   [20] Paul Kocher, Joshua Jaffe and Benjamin Jun. Differential Power     Analysis. Advances in Cryptology—Crypto 99 Proceedings. LNCS Volume     1666, M. Weiner, edited, Springer-Verlag, (1999). -   [21] J. E. Lilienfeld. Method and apparatus for controlling electric     currents. U.S. Pat. No. 1,745,175: Jan. 28, 1930. Oct. 8, 1926. -   [22] J. E. Lilienfeld. Device for controlling electric current. U.S.     Pat. No. 1,900,018: Mar. 7, 1933. Mar. 28, 1928. -   [23] Carver Mead. Analog VLSI and Neural Systems. Addison-Wesley     Publishing Company (1989) -   [24] Lily Hay Newman. What We Know About Friday's Massive East Coast     Internet Outage. Wired Magazine. Oct. 21, 2016.     https://www.wired.com/2016/10/internet-outage-ddos-dns-dyn/ -   [25] NIST. FIPS-180-2: Secure Hash Standard, August 2002.     http://www.itl.nist.goy/fipspubs/. -   [26] Robert N. Noyce. Semiconductor Device-and-Lead Structure. U.S.     Pat. No. 2,981,877. 1959. -   [27] M. Riordan, Lillian Hoddeson, and Conyers Herring. The     invention of the transistor. Reviews of Modern Physics, vol. 71, no.     2, Centenary 1999. American Physical Society, 1999. -   [28] Claude Shannon: The synthesis of two-terminal switching     circuits. Bell Systems Technical Journal. 28, 59-98, (1949) -   [29] Alan M. Turing. On computable numbers, with an application to     the Entscheidungsproblem. Proc. London Math. Soc. Series 2 42 (Parts     3 and 4), 230265 (1936). A correction, ibid. 43, 544546 (1937). -   [30] Alan M. Turing. Proposals for Development in the Mathematics     Division of an Automatic Computing Engine (ACE), Report E882. NPL,     1945. -   [31] Herbert Vollmer: Introduction to Circuit Complexity. Springer,     Heidelberg (1999) -   [32] A. F. Webster and S. E. Tavares. On the Design of S-Boxes.     Advances in Cryptology. CRYPTO 85 Proceedings. LNCS 218. Springer,     523-534, 1986. -   [33] Hongjun Wu. The Hash Function JH. 2011.     http://ehash.iaik.tugraz.at/wiki/JH     http://www3.ntu.edu.sg/home/wuhj/research/jh/jh_round3.pdf -   [34] Hao Yan, Liping Feng, Thomas H. LaBean and John H. Reif.     Parallel Molecular Computations of Pairwise Exclusive-Or (XOR) Using     DNA String Tile Self-Assembly. J. Am. Chem. Soc., 125, 47,     14246-14247, 2003. -   [35] Konrad Zuse. Patentanmeldung Z-2391, German Patent Office,     1941. -   [36] Konrad Zuse. Der Computer mein Lebenswerk. Springer-Verlag,     1970. 

The invention claimed is:
 1. A computing process for performing a computational procedure comprising: constructing a first method of a multiplicity of possible methods for a first instance of the procedure; performing the first instance of the procedure with one or more clock machines; constructing a second method of the multiplicity of possible methods for a second instance of the procedure; and performing the second instance of the procedure with one or more clock machines; wherein the one or more clock machines performing the first instance of the procedure are not identical to the one or more clock machines performing the second instance of the procedure; wherein the first instance of the procedure and the second instance of the procedure perform the same operation, but the first instance of the procedure performs the operation, via the first method, and the second instance of the procedure performs the procedure, via the second method; wherein the said procedure implements the Midori cipher.
 2. The computing process of claim 1 wherein at least one of the clock machines performing the second instance of the procedure has a different number of time states than each of the clock machines performing the first instance of the procedure.
 3. The computing process of claim 1 wherein the first instance of the procedure uses two or more clock machines and at least two clocks have a different number of time states.
 4. The computing process of claim 1 wherein at least one clock machine is implemented with one or more flip flops.
 5. The computing process of claim 4 wherein said flip flops are implemented with a semiconductor material.
 6. The computing process of claim 1 wherein at least one clock machine is implemented with a virtual machine.
 7. A computing process for performing a computational procedure comprising: constructing a first method of a multiplicity of possible methods for a first instance of the procedure; performing the first instance of the procedure with one or more clock machines; constructing a second method of the multiplicity of possible methods for a second instance of the procedure; and performing the second instance of the procedure with one or more clock machines; wherein the one or more clock machines performing the first instance of the procedure are not identical to the one or more clock machines performing the second instance of the procedure; wherein the first instance of the procedure and the second instance of the procedure perform the same operation, but the first instance of the procedure performs the operation, via the first method, and the second instance of the procedure performs the procedure, via the second method; wherein the constructing of the first instance of the procedure and constructing of the second instance of the procedure are based on a non-deterministic process.
 8. The computing process of claim 7, wherein the non-deterministic process is based at least on a behavior of photons.
 9. The computing process of claim 8, wherein said photons are absorbed by a photodetector.
 10. The computing process of claim 8, wherein said photons are absorbed by a phototransistor.
 11. A computing machine for performing computations comprising: n distinct clock machines, with n≥1, that comprise the computing machine; wherein each clock machine has a time state; wherein the input of each clock machine is an input state; wherein the output of each clock machine is an output state; wherein combining n output states computes an output for the computing machine; wherein said combining comprises the following: each clock machine producing an output state from its input state and time state; applying a mod 2 operation to each clock machine output state; resulting in an output bit for each clock machine; computing an n-bit exclusive-OR on said output bits.
 12. The computing machine of claim 11 wherein performing computations is at least part of a cryptographic computation.
 13. The computing machine of claim 11 wherein at least one clock machine is implemented with one or more flip flops.
 14. The computing machine of claim 11 wherein said clock machines are implemented with a field-programmable gate array.
 15. A computing machine for performing computations comprising: n distinct clock machines, with n≥1, that comprise the computing machine; wherein each clock machine has a time state; wherein the input of each clock machine is an input state; wherein the output of each clock machine is an output state; wherein combining n output states computes an output for the computing machine; wherein said combining comprises the following: each clock machine computes an output state from its input state and time state; and adds the clock machine output state of each clock machine.
 16. The computing machine of claim 15 wherein said output is at least part of the computation of the Midori cipher.
 17. A computing machine for performing computations comprising: one or more clock machines that comprise the computing machine; wherein each said clock machine has two or more time states; wherein input to each clock machine is a time state; wherein the intermediate output of each clock machine is a time state; wherein the combining of the one or more intermediate outputs from each clock machine generates a final output for the computing machine; wherein at least some of the starting time states of the said clock machines are chosen based on a non-deterministic process. 